POJ 2159

#include<iostream>
#include<string>
#include<stdio.h>
#include<algorithm>
#define MAXN 105
using namespace std;
int c[2][26];
int main()
{
///freopen("acm.acm","r",stdin);
int i;
int len_0;
int len_1;
string s1;
string s2;
cin>>s1>>s2;
len_0 = s1.length();
len_1 = s2.length();
if(len_0 != len_1)
{
cout<<"NO"<<endl;
return 0;
}
for(i = 0; i < len_0; ++ i)
{
++ c[0][s1[i] - 'A'];
++ c[1][s2[i] - 'A'];
}
sort(c[0],c[0]+26);
sort(c[1],c[1]+26);
for(i = 0; i < 26; ++ i)
{
if(c[0][i] != c[1][i])
{
cout<<"NO"<<endl;
return 0;
}
}
cout<<"YES"<<endl;
}

/*
if(equal(c[0],c[0]+strlen(c[0]),c[1]))
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;

*/