UVa OJ 642

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int n;
char word[2000][10], sorted[2000][10];
int cmp_char(const void* _a, const void* _b) {
  char* a = (char*)_a;
  char* b = (char*)_b;
  return *a - *b;
}
int cmp_string(const void* _a, const void* _b) {
  char* a = (char*)_a;
  char* b = (char*)_b;
  return strcmp(a, b);
}
int main() {
  n = 0;
  for(;;) {
    scanf("%s", word[n]);
    if(word[n][0] == 'X') break;
    n++;
  }
  qsort(word, n, sizeof(word[0]), cmp_string);
  for(int i = 0; i < n; i++) {
    strcpy(sorted[i], word[i]);
    qsort(sorted[i], strlen(sorted[i]), sizeof(char), cmp_char);
  }
  char s[10];
  while(scanf("%s", s) == 1) {
    if(s[0] == 'X') break;
    qsort(s, strlen(s), sizeof(char), cmp_char);
    int found = 0;
    for(int i = 0; i < n; i++)
      if(strcmp(sorted[i], s) == 0) {
        found = 1;
        printf("%s\n", word[i]);
      }
    if(!found) printf("NOT A VALID WORD\n");
    printf("******\n");
  }
  return 0;
}