//poj2159 水题 #include <iostream> #include <string> #include <algorithm> using namespace std; int main() { string a; getline(cin, a); string b; getline(cin, b); int c[26]; int d[26]; memset(c, 0, sizeof(c)); memset(d, 0, sizeof(d)); for(int i = 0; i < a.length(); i++) { c[a[i] - 'A']++; } for(int i = 0; i < b.length(); i++) { d[b[i] - 'A']++; } sort(c, c+26); sort(d, d+26); bool ok = true; if(a.length() == b.length()) { for(int i = 0; i < 26; i++) { if(c[i] != d[i]) ok = false; } if(ok) cout<<"YES"<<endl; else cout<<"NO"<<endl; } else cout<<"NO"<<endl; return 0; }