g****y
发帖数: 323 | 1 我自己是有算法的。
最有趣的要算怎么辨别两个String是否同Crypt。
我有个简单的方法。
Problem D - Cryptoquivalence Classes
We create a cryptogram of some text if we replace each
occurence of the letter A by one letter of the alphabet,
each occurence of the letter B by some other letter of the
alphabet, and so on. For example, one cryptogram of "TO BE
OR NOT TO BE" is "ZX OI XR AXZ ZX OI". Another cryptogram of
the same phrase is "AB CD BE FBA AB CD". More precisely, a
cryptogram of some text is the result of applying a function
f to |
|
