poj 2159

代码如下

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int main(){string s;int a[26];int b[26];memset(a,0,sizeof(a));memset(b,0,sizeof(b));cin>>s;for(int i=0;i<s.length();i++){a[s[i]-'A']++;}cin>>s;for(int i=0;i<s.length();i++){b[s[i]-'A']++;}sort(a,a+26);sort(b,b+26);for(int i=0;i<26;i++){if(a[i]!=b[i]){printf("NO\n");return 0;}}printf("YES\n");return 0; }