第一章-问题求解策略-LA3213-Ancient Cipher

#include<iostream>
#include<cstdio> 
#include<algorithm>
#include<cstring>
using namespace std;
char a[105],b[105];
int ca[30],cb[30];
void init()
{
	memset(ca,0,sizeof(ca));
	memset(cb,0,sizeof(cb));
	memset(a,0,sizeof(a));
	memset(b,0,sizeof(b));
}
int main()
{
	//freopen("read.txt","r",stdin);
	//freopen("write.txt","w",stdout);
	ios::sync_with_stdio(false);
	init();
	while(cin>>a&&cin>>b)
	{
		sort(a,a+strlen(a));
		sort(b,b+strlen(b));
		int n=strlen(a);
		for(int i=0;i<n;i++)
		{
			ca[a[i]-'A']++;
			cb[b[i]-'A']++;
		}
		sort(ca,ca+30);
		sort(cb,cb+30);
		bool flag=true;
		for(int i=0;i<30;i++)
		{
			if(ca[i]!=cb[i])
			{
				flag=false;
				cout<<"NO"<<endl;
				break;
			}
		}
		if(flag)
		cout<<"YES"<<endl;
		init();
	}
	return 0;
}