UVa 642 - Word Amalgamation

　　《算法竞赛入门经典》5.3.2的题目，题目大意：输入一个字典，然后再输入若干单词。每输入一个单词w，你都需要在字典中找出所有可以用w的字母重排后得到的单词，并按照字典序从小到大的顺序输出。代码如下:

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

char dict[110][8], sorted_dict[110][8];

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()
{
#ifdef LOCAL    
    freopen("in", "r", stdin);
#endif
    int n = 0;
    int i;
    while(scanf("%s", dict[n++]) != EOF)
    {
        if(strcmp(dict[n-1], "XXXXXX") == 0)   break;
    }
    qsort(dict, n, sizeof(dict[0]), cmp_string);
    for(i = 0; i < n; i++)
    {
        strcpy(sorted_dict[i], dict[i]);
        qsort(sorted_dict[i], strlen(sorted_dict[i]), sizeof(char), cmp_char);
    }
    char s[10];
    while(scanf("%s", s) != EOF)
    {
        if(strcmp(s, "XXXXXX") == 0)   break;
        qsort(s, strlen(s), sizeof(char), cmp_char);
        int ok = 0;
        for(i = 0; i < n; i++)
            if(strcmp(s, sorted_dict[i]) == 0)
            {
                printf("%s\n", dict[i]);
                ok = 1;
            }
        if(!ok)   printf("NOT A VALID WORD\n");
        printf("******\n");
    }
    return 0;
}