UVa 1339 Ancient Cipher --- 水题

/* UVa 1339 Ancient Cipher --- 水题 */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

char a[105], b[105];
int cnt1[30], cnt2[30];

int main()
{
#ifdef _LOCAL
    freopen("D:\\input.txt", "r", stdin);
#endif

    while (scanf("%s%s", a, b) == 2){
        memset(cnt1, 0, sizeof cnt1);
        memset(cnt2, 0, sizeof cnt2);
        int len1 = strlen(a);
        int len2 = strlen(b);

        //0-25记录A-Z
        for (int i = 0; i < len1; ++i){
            ++cnt1[a[i] - ‘A‘];
            ++cnt2[b[i] - ‘A‘];
        }

        sort(cnt1, cnt1 + 26);
        sort(cnt2, cnt2 + 26);

        bool flag = 1;
        for (int i = 0; i < 26; ++i){
            if (cnt1[i] != cnt2[i]){
                flag = 0;
                break;
            }
        }
        printf("%s\n", flag ? "YES" : "NO");
    }

    return 0;
}