UVa 1339 - Ancient Cipher Solution

#include<iostream>
#include<cstdio>
#include<list>
#include<string>
#include<cstring>
#include<sstream>
#include<cctype>
#include<string.h>
#include<algorithm>
#include<cmath>
#include<stack>
#include<fstream>
#include<cstdlib>
#include<vector>
#include<map>
#include<set>
#include<utility>
#include<iomanip>
#include<queue>
#include<deque>
#include<iterator>
#include<assert.h>
#include<bitset>
#include<climits>
#include<ctime>
#include<complex>

using namespace std;

#define SET(a) memset(a,-1,sizeof(a))
#define ALL(a) a.begin(),a.end()
#define CLR(a) memset(a,0,sizeof(a))
#define PB push_back
#define PI acos(-1.0)
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define READ freopen("input.txt", "r", stdin)
#define WRITE freopen("output.txt", "w", stdout)
#define LL long long

#define S(a) scanf("%d",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define KS printf("Case %d: ",kk++)

#define MOD 1000000007
#define MX 100010

int main()
{
    int a,b,c,w,x,y,z,n,m,u,v,cnt,mx,mn,p,q,r,sum;
    bool chk;
    string s,s2;
    int arrs[30],arrs2[30];
    while(cin>>s>>s2)
    {
        CLR(arrs); CLR(arrs2);
        int sl=s.length();
        for(int i=0;i<sl;i++)
            arrs[s[i]-'A']++;
        for(int i=0;i<sl;i++)
            arrs2[s2[i]-'A']++;

        /*for(int i=0;i<26;i++)
        {
            int tmp=arrs[25];
            for(int j=25;j>0;j--)   arrs[j]=arrs[j-1];
            arrs[0]=tmp;*/
        sort(arrs,arrs+26);
        sort(arrs2,arrs2+26);
            chk=true;
            for(int i=0;i<26;i++)
                if(arrs[i]!=arrs2[i])
                    chk=false;

        if(chk) cout<<"YES"<<endl;
        else cout<<"NO"<<endl;

    }
    return 0;
}