UVA--1339(思维，字符串记录+排序)

#include<iostream>
#include<cstdio>
#include<vector>
#include<cstring>
#include<algorithm>
using namespace std;
int n1[27],n2[27];
int main()
{
    string s1,s2;
    while(cin>>s1>>s2)
    {
        memset(n1,0,sizeof(n1));
        memset(n2,0,sizeof(n2));
        for(int i=0;i<s1.length();i++)
        {
            n1[s1[i]-65]++;
            n2[s2[i]-65]++;
        }
        sort(n1,n1+26);
        sort(n2,n2+26);
        int ok = 0 ;
        for(int i=0;i<26;i++)
        {
            if(n1[i]!=n2[i])
            {
                ok=1;break;
            }
        }
        if(ok)
            cout<<"NO"<<endl;
        else
            cout<<"YES"<<endl;
    }
}