#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
int main()
{ char s1[105],s2[105];
int i,j;
while(cin>>s1>>s2)
{if(strlen(s1)!=strlen(s2)) {cout<<"NO"<<endl;continue;}
int a[26]={0},b[26]={0};
for(i=0;s1[i]!='\0';i++)
{++a[s1[i]-'A']; ++b[s2[i]-'A'];}
sort(a,a+26); sort(b,b+26);
if(memcmp(a,b,sizeof(a))==0) cout<<"YES"<<endl;//memcmp()??????????????????????????????????????????1???0???1???
else cout<<"NO"<<endl;
}
return 0;
}
poj 2159 古老的密码(字符串)
最新推荐文章于 2020-05-28 09:55:47 发布