#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
using namespace std;
int main()
{
freopen("input.txt","r",stdin);
string s1,s2;
int c1[26],c2[26],i,flag;
while(cin>>s1>>s2){
memset(c1,0,sizeof(c1));
memset(c2,0,sizeof(c2));
for(i=0;i<s1.size();i++)
c1[s1[i]-'A']++;
for(i=0;i<s2.size();i++)
c2[s2[i]-'A']++;
sort(c1,c1+26);
sort(c2,c2+26);
flag=1;
for(i=0;i<26;i++)
if(c1[i]!=c2[i]){
flag=0;
break;
}
if(flag)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
return 0;
}
UVA - 1339 Ancient Cipher
最新推荐文章于 2021-04-03 16:58:59 发布