p2159.cpp

大概POJ上50道比较难的题的代码

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
    string s1,s2,t;
    int v[101],v1[101],v2[101];
    int n;
    cin >> s1 >> s2;
    n = s1.size();
    memset(v,0,sizeof(v));
    memset(v1,0,sizeof(v1));
    memset(v2,0,sizeof(v2));
    for(int i = 0;i < n;++i) ++v[s1[i]-'A'];
    for(int i = 0;i < 101;++i) ++v1[v[i]];
    memset(v,0,sizeof(v));
    for(int i = 0;i < n;++i) ++v[s2[i]-'A'];
    for(int i = 0;i < 101;++i) ++v2[v[i]];
    for(int i = 0;i < 101;++i)
        if(v1[i] != v2[i]){
            puts("NO");
            return 0;
        }
    puts("YES");
}