UVa 1339 - Ancient Cipher

#include<string.h>
#include<stdio.h>
int cnt1[26]= {0},cnt2[26]= {0};
char str1[110],str2[110];
int main()
{
int i,j,n,n1,n2;
while(scanf("%s%s",str1,str2)!=EOF)
{
int count=0;
memset(cnt1,0,sizeof(cnt1));
memset(cnt2,0,sizeof(cnt2));
n=strlen(str1);
for(i=0; i<n; i++)
{
cnt1[str1[i]-'A']++;
cnt2[str2[i]-'A']++;
}
for(i=0; i<26; i++)
{
for(j=0; j<26; j++)
{
if(cnt1[i]==cnt2[j]&&cnt1[i]!=0&&cnt2[j]!=0)
{count+=cnt2[j];
cnt2[j]=0;
break;}
}
}
if(count==n)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}