Ancient Cipher UVA - 1339

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[36];
int b[36];
char c[136];
char d[136];
bool map(int x,int y){return x>y;
} 
int main()
{
	while(1)
	{
		
		if(scanf("%s %s",c,d)!=2)return 0;
		getchar();
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for(int i=0;c[i]!='\0';i++)
		{
			a[c[i]-'A']++;
			
		}
		for(int i=0;d[i]!='\0';i++)
		{
			b[d[i]-'A']++;
		}
		sort(a,a+26,map);
		sort(b,b+26,map);
		bool flag=true;
		for(int i=0;i<26;i++)
		{
			//printf("%d %d\n",a[i],b[i]);
			if(a[i]!=b[i]){flag=false;break;
			}
		}
		if(flag)printf("YES\n");
		else printf("NO\n");
	}
	
	
	return 0;
}