Result: Accepted
Time: 1ms
Memory: 1700kB
#include<bits/stdc++.h>
using namespace std;
int comp(const void *p, const void *q) {
return (*(char *)p - *(char *)q);
}
int main() {
int T;
cin >> T;
getchar();
while(T--) {
char s1[100] = {};
char s2[100] = {};
char sold[100] = {};
char snew[100] = {};
gets(sold);
gets(snew);
int i, j;
for (i = 0, j = 0; i < strlen(sold); i++) {
if(sold[i] >= 'a' && sold[i] <= 'z') {
s1[j] = sold[i];
j++;
}
}
int length1 = strlen(s1);
for (i = 0, j = 0; i < strlen(snew); i++) {
if(snew[i] >= 'a' && snew[i] <= 'z') {
s2[j] = snew[i];
j++;
}
}
int length2 = strlen(s2);
qsort(s1, length1, sizeof(char), comp);
qsort(s2, length2, sizeof(char), comp);
if(strcmp(s1, s2) == 0)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
return 0;
}