UVa 1339 Ancient

#include<stdio.h>#include<string.h>#include<iostream>#include<algorithm>using namespace std;char s1[109],s2[109];int cnt1[26];int cnt2[26];int main(){    while(~scanf("%s",s1)){        scanf("%s",s2);        memset(cnt1,0,sizeof(cnt1));        memset(cnt2,0,sizeof(cnt2));        int flag=0;        for(int i=0;i<strlen(s1);i++)            cnt1[s1[i]-'A']++;        for(int i=0;i<strlen(s2);i++)            cnt2[s2[i]-'A']++;        sort(cnt1,cnt1+26);        sort(cnt2,cnt2+26);        for(int i=0;i<26;i++){            if(cnt1[i]!=cnt2[i]){                flag++;                break;            }        }        if(!flag)            puts("YES");        else            puts("NO");    }    return 0;}