UVA 1339 UVALLive 3213 POJ 2159 ZOJ 2658 Ancient Cipher【パスワード】

Ancient Cipher
Time Limit: 1000MS
 
Memory Limit: 65536K
Total Submissions: 35753
 
Accepted: 11639
Description
Ancient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form to prevent eavesdropping. The most popular ciphers in those times were so called substitution cipher and permutation cipher.
 
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
Input contains two lines. The first line contains the message engraved on the plate. Before encrypting, all spaces and punctuation marks were removed, so the encrypted message contains only capital letters of the English alphabet. The second line contains the original message that is conjectured to be encrypted in the message on the first line. It also contains only capital letters of the English alphabet.
 
The lengths of both lines of the input are equal and do not exceed 100.
Output
Output "YES"if the message on the first line of the input file could be the result of encrypting the message on the second line, or "NO"in the other case.
Sample Input

JWPUDJSTVP
VICTORIOUS

Sample Output

YES

Source
Northeastern Europe 2004
Regionals 2004 >> Europe - Northeastern
質問リンク:UVA 1339 UVALLive 3213 POJ 2159 ZOJ 2658 Ancient Cipher.
質問の簡単な説明:(略)
問題分析:2つの文字列をそれぞれアルファベット統計し、統計結果をソートし、ソート後の結果を比較します.同じ場合、説明は、2つの文字列が同じになるように1つのマッピングを見つけることができます.
プログラムの説明:2つの非文字値が等しいかどうかを比較し、関数memcmp()を使用して実装することもできます.関連リンクを参照してください.
ACのC言語プログラムは以下の通りである.

/* UVA1339 UVALive3213 POJ2159 ZOJ2658 Ancient Cipher */

#include 
#include 
#include 
#include 

#define LETTERNUM 26
#define MAXN     100

int cmp(const void * a, const void * b)
{
    return *(int *)a - *(int *)b;
}

int main(void)
{
    char s[MAXN+1], t[MAXN+1];
    int counts[LETTERNUM], countt[LETTERNUM], len, flag, i;

    while(scanf("%s", s) != EOF) {
        scanf("%s", t);

        memset(counts, 0, sizeof(counts));
        memset(countt, 0, sizeof(countt));

        len = strlen(s);
        for(i=0; i