UVa 1339 Ancient Cipher

　　统计每个字母出现的次数，然后进行比较就行了。代码如下：

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

int main()
{
#ifdef LOCAL
    freopen("in", "r", stdin);
#endif
    char alpha[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
    char s[110];
    while(scanf("%s", s) != EOF)
    {
        int len = strlen(s);
        int a[26];
        memset(a, 0, sizeof(a));
        for(int i = 0; i < len; i++)
            a[strchr(alpha, s[i])-alpha]++;
        scanf("%s", s);
        int b[26];
        memset(b, 0, sizeof(b));
        for(int i = 0; i < len; i++)
            b[strchr(alpha, s[i])-alpha]++;
        sort(a, a+26);
        sort(b, b+26);
        int i;
        for(i = 0; i < 26; i++)
            if(a[i] != b[i])   break;
        if(i == 26)   printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}