LA 3213 Ancient Cipher

 1 //#define LOCAL
 2 #include <algorithm>
 3 #include <cstdio>
 4 #include <cstring>
 5 using namespace std;
 6 
 7 char s1[200], s2[200];
 8 int a[30], b[30];
 9 
10 int main(void)
11 {
12     #ifdef LOCAL
13         freopen("3213in.txt", "r", stdin);
14     #endif
15 
16     while(scanf("%s%s", s1, s2) == 2)
17     {
18         memset(a, 0, sizeof(a));
19         memset(b, 0, sizeof(b));
20         int i;
21         for(i = 0; s1[i] != ‘\0‘; ++i)
22         {
23             ++a[s1[i] - ‘A‘];
24             ++b[s2[i] - ‘A‘];
25         }
26         sort(a, a + 26);
27         sort(b, b + 26);
28         for(i = 0; i < 26; ++i)
29             if(a[i] != b[i])
30                 break;
31         if(i == 26)
32             printf("YES\n");
33         else
34             printf("NO\n");
35     }
36     return 0;
37 }