Start: Dec, 04, 2016 12:00:00
杭州师范大学第十届程序设计竞赛—正式
End: Dec, 04, 2016 17:00:00
Time elapsed:
Time remaining:

Problem_ID: F
Result: Accepted
Time: 1ms
Memory: 1096kB
In contest: 1075

#include <stdio.h>
#include <string.h>
int main ()
{
	int t,i,l1,l2;
	char juzi1[666];
	char juzi2[666];
	int flag;
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		int list1[66]={0};
		int list2[66]={0};
		flag=1;
		gets(juzi1);
		l1=strlen(juzi1);
		for(i=0;i<=l1-1;i++)
		{
			if(juzi1[i]>='a'&&juzi1[i]<='z')
			{
				list1[juzi1[i]-'a']++;
			}
		}
		gets(juzi2);
		l2=strlen(juzi2);
		for(i=0;i<=l2-1;i++)
		{
			if(juzi2[i]>='a'&&juzi2[i]<='z')
			{
				list2[juzi2[i]-'a']++;
			}
		}
		for(i=0;i<=25;i++)
		{
			if(list1[i]!=list2[i])
			{
				flag=0;
			}
		}
		if(flag)
		{
			printf("Yes\n");
		}
		else
		{
			printf("No\n");
		}
	}
}