zoj 2658 Ancient Cipher

#include<stdio.h>#include<string.h>#include<algorithm>int cmp(const void *a,const void *b){   return *(int*)a-*(int *)b;    }int main(){    int num1[105],num2[105],flag;    int i,t1,t2,l1,l2;    char s1[105],s2[105];    while(scanf("%s",s1)!=EOF)    {        scanf("%s",s2);        l1=strlen(s1);        l2=strlen(s2);        memset(num1,0,sizeof(num1));        for(i=0;i<l1;i++){t1=s1[i]-'A';   num1[t1]++; }        qsort(num1,26,sizeof(num1[0]),cmp);        memset(num2,0,sizeof(num2));        for(i=0;i<l2;i++){t2=s2[i]-'A';num2[t2]++; }        qsort(num2,26,sizeof(num2[0]),cmp);        flag=0;        for(i=0;i<26;i++){ if(num1[i]!=num2[i]){     flag=1;     break;     } } if(flag==0)   printf("YESn");        else printf("NOn");    }    return 0;    }