Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 20788 | Accepted: 7010 |
Description
Substitution cipher changes all occurrences of each letter to some other letter. Substitutes for all letters must be different. For some letters substitute letter may coincide with the original letter. For example, applying substitution cipher that changes all letters from 'A' to 'Y' to the next ones in the alphabet, and changes 'Z' to 'A', to the message "VICTORIOUS" one gets the message "WJDUPSJPVT".
Permutation cipher applies some permutation to the letters of the message. For example, applying the permutation <2, 1, 5, 4, 3, 7, 6, 10, 9, 8> to the message "VICTORIOUS" one gets the message "IVOTCIRSUO".
It was quickly noticed that being applied separately, both substitution cipher and permutation cipher were rather weak. But when being combined, they were strong enough for those times. Thus, the most important messages were first encrypted using substitution cipher, and then the result was encrypted using permutation cipher. Encrypting the message "VICTORIOUS" with the combination of the ciphers described above one gets the message "JWPUDJSTVP".
Archeologists have recently found the message engraved on a stone plate. At the first glance it seemed completely meaningless, so it was suggested that the message was encrypted with some substitution and permutation ciphers. They have conjectured the possible text of the original message that was encrypted, and now they want to check their conjecture. They need a computer program to do it, so you have to write one.
Input
The lengths of both lines of the input are equal and do not exceed 100.
Output
Sample Input
JWPUDJSTVP VICTORIOUS
Sample Output
YES
java代码:
import java.util.Arrays; import java.util.Scanner;
public class Main{
public static void main(String[] args) { Scanner in = new Scanner(System.in); while (in.hasNext()) {
String cipher = in.next(); String original = in.next(); int ci[] = new int[26]; int or[] = new int[26]; for (int i = 0; i < cipher.length(); i++) { ci[cipher.charAt(i) - 'A']++; } for (int i = 0; i < original.length(); i++) { or[original.charAt(i) - 'A']++; } Arrays.sort(ci); Arrays.sort(or); int flag = 1; for (int i = 0; i < 26; i++) { if (ci[i] != or[i]) { System.out.println("NO"); flag = 0; break; } } if (flag == 1) System.out.println("YES");
}
} }