UVA 1339 Ancient Cipher(水题)

题意好难看懂。

////  main.cpp//  Richard////  Created by 邵金杰 on 16/10/3.//  Mail:[e-mail] or [e-mail]//  Copyright © 2016年 邵金杰. All rights reserved.//#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=100+10;int a[26],b[26];char s1[maxn],s2[maxn];int main(){    while(scanf("%s%s",s1,s2)!=EOF)    {        memset(a,0,sizeof(a));        memset(b,0,sizeof(b));        for(int i=0;s1[i];i++) {a[s1[i]-'A']++;b[s2[i]-'A']++;}        sort(a,a+26);        sort(b,b+26);        bool ok=true;        for(int i=0;i<26;i++) if(a[i]!=b[i]) {ok=false;break;}        if(ok) printf("YES\n");        else printf("NO\n");    }    return 0;}