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>
#include<stdlib.h>
int cmp(const void*p,const void*q)
{
	return (*(char*)p-*(char*)q);
}
void main()
{
	int t,i,j,k,p;
    char a[200],b[200],a1[200],b1[200];
	scanf("%d",&t);
	getchar();
	while(t--)
	{
		gets(a);
		gets(b);
		int len1=strlen(a);
		int len2=strlen(b);
		for(i=0,k=0;i<len1;i++)
		{
			if(a[i]!=' ')
			{
				a1[k]=a[i];
				k++;
			}
		}
		for(i=0,p=0;i<len2;i++)
		{
			if(b[i]!=' ')
			{
				b1[p]=b[i];
				p++;
			}
		}
		//int len11=strlen(a1);
		//int len22=strlen(b1);
		qsort(a1,k,sizeof(char),cmp);
		qsort(b1,p,sizeof(char),cmp);
		for(j=0;j<k;j++)
		{
			if(a1[j]!=b1[j]) break;
		}
		if(j==k) printf("Yes\n");
		else printf("No\n");

	}
}