UVA 156－Ananagrams

UVA 156－Ananagrams

#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
int cmp1(const void *a,const void *b) {
return *(char*)a - *(char*)b;
}
int cmp2(const void *a, const void *b) {
return strcmp((char*)a,(char*)b);
}
int main() {
char a[10000][10000];
char b[10000][10000];
char d[10000][10000];
int n = 0;
while(scanf("%s", a
) && a
[0] != '#') {
strcpy(b
, a
);
n++;
}
for(int i = 0; i < n; i++) {
for(int j = 0; b[i][j] != '\0'; j++) {
if(b[i][j] >= 'A' && b[i][j] <= 'Z')
b[i][j] = b[i][j] + 32;
}
qsort(b[i], strlen(b[i]), sizeof(char), cmp1);

}
int s = 0;
for(int i = 0; i < n; i++)
for(int j = 0; j < n; j++) {
if(i != j)
if((strcmp(b[i],b[j])) == 0) {
break;
}
if(j + 1 == n) {
strcpy(d[s], a[i]);
s++;
}

}
qsort(d, s, sizeof(d[0]), cmp2);
for(int i = 0; i < s; i++)
puts(d[i]);
return 0;
}