Result: Accepted
Time: 1ms
Memory: 1700kB
#include<iostream>
#include<cstdlib>
#include<cstring>
using namespace std;
int comp(const void*a,const void*b){
return (*(char*)b-*(char*)a);
}
int len(char*x){
int i,j;
for(i=0;i<strlen(x);++i){
if(x[i]==' '){
x[i]='\0';
break;
}
}
return i;
}
int xiao(char*x){
int i,j;
for(i=0;i<strlen(x);++i){
if(x[i]==' '){
x[i]='\0';
}
}
return i;
}
int main(){
int i,t,n,m,s;char a[186],b[186];
cin>>t;
getchar();
while(t--){
gets(a);
gets(b);
qsort(a,strlen(a),sizeof(char),comp);
qsort(b,strlen(b),sizeof(char),comp);
xiao(a);xiao(b);
// printf("%s8\n%s8\n%d%d\n",a,b,len(a),len(b));
if(len(a)==len(b)&&strcmp(a,b)==0)
puts("Yes");
else puts("No");
}
}