poj

还不太会用 这儿也是 ->

#include<iostream>#include<algorithm>#include<cstdio>#include<cstring>using namespace std;char s1[1000], s2[1000];int a1[30] = {0}, a2[30] = {0};void solve() {    for(int i = 0; i < strlen(s1); ++i) {        a1[s1[i] - 'A']++;        a2[s2[i] - 'A']++;    }    sort(a1, a1+26);    sort(a2, a2+26);    for(int i = 0; i < 26; ++i)    if(a1[i] != a2[i]) {        printf("NO"); return;    }    printf("YES"); return;}int main() {    scanf("%s%s", s1, s2);    solve();    return 0;}