（代码实现）北京大学-JudgeOnline-1318

先把代码实现部分写出来吧，然后分析，希望大家尊重源代码，只当作参考。
源代码：
//AC


#include "stdio.h"
#include "string.h"
#define MAXLEN 1000

char a[MAXLEN][8];//原字符串
char b[MAXLEN][8];//排序后的字符串
char c[MAXLEN][8];//打乱的字符串
char d[MAXLEN][8];//打乱的字符串的排序
char v[6]={'X','X','X','X','X','X'};
char z[6]={'x','x','x','x','x','x'};
char tt[8];

int main()
{
    int flag,sa=0,sc=0;//sa原字符串的个数,sc打乱的字符串的个数
    int ssb,ssd,m,j,i=0;
    char t;
    while(1)
    {
        scanf("%s",a[i++]);
            
        if( !(strcmp(a[i-1],v) && strcmp(a[i-1],z)) )
        {sa=i-1;i=0;break;}
    }

    for(i=sa;i>0;i--)
    {
        for(m=0;m<i;m++)
            if(strcmp(a[m],a[m+1])>0)
            {
                strcpy(tt,a[m+1]);
                strcpy(a[m+1],a[m]);
                strcpy(a[m],tt);
            }
    }

    for(i=0;i<sa;i++)
    {
        strcpy(b[i],a[i]);
        ssb=strlen(b[i]);
        for(j=ssb;j>0;j--)
        {
            for(m=0;m<j-1;m++)
                if(b[i][m]>b[i][m+1])
                {
                    t=b[i][m+1];
                    b[i][m+1]=b[i][m];
                    b[i][m]=t;
                }
        }
    }


    i=0;

    while(1)
    {
   
        scanf("%s",c[i++]);

        if( !(strcmp(c[i-1],v) && strcmp(c[i-1],z)) )
        {sc=i-1;i=0;break;}

        strcpy(d[i-1],c[i-1]);
        ssd=strlen(d[i-1]);
        for(j=ssd;j>0;j--)
        {
            for(m=0;m<j-1;m++)
                if(d[i-1][m]>d[i-1][m+1])
                {
                    t=d[i-1][m+1];
                    d[i-1][m+1]=d[i-1][m];
                    d[i-1][m]=t;
                }
        }
    }

    for(i=0;i<sc;i++)
    {
        flag=0;
        for(j=0;j<sa;j++)
        {
            if(!strcmp(d[i],b[j]))
            {
                printf("%s/n",a[j]);
                flag=1;
            }
        }
        if(flag==0)
            printf("NOT A VALID WORD/n");
        printf("******/n");
    }
    return 0;
}

解题思路：
对于这道题，首先我们会发现它的规模不是很大，对于我们来说，比较好入手。（间接导致我后来算法的选择）
这个题目考察的是字符串比较，处理。
首先，根据样例输出中的提示，我们必须对输入的dictionary进行升序排序
然后问题的核心是怎么将打乱顺序的字符串还原成dictionary中的单词，这个需要用到一个思想。
我们可以将dictionary中每个单词都进行升序排序，然后对打乱的字符串进行一样的操作，这样就俱有可比性了

原题：

Word Amalgamation
Time Limit:1000MS  Memory Limit:10000K
Total Submit:1236 Accepted:753

Description
In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the answer it is necessary to unscramble four words. Your task is to write a program that can unscramble words.

Input
The input contains four parts: 1) a dictionary, which consists of at least one and at most 100 words, one per line; 2) a line containing XXXXXX, which signals the end of the dictionary; 3) one or more scrambled 'words' that you must unscramble, each on a line by itself; and 4) another line containing XXXXXX, which signals the end of the file. All words, including both dictionary words and scrambled words, consist only of lowercase English letters and will be at least one and at most six characters long. (Note that the sentinel XXXXXX contains uppercase X's.) The dictionary is not necessarily in sorted order, but each word in the dictionary is unique.

Output
For each scrambled word in the input, output an alphabetical list of all dictionary words that can be formed by rearranging the letters in the scrambled word. Each word in this list must appear on a line by itself. If the list is empty (because no dictionary words can be formed), output the line "NOT A VALID WORD" instead. In either case, output a line containing six asterisks to signal the end of the list.

Sample Input

tarp
given
score
refund
only
trap
work
earn
course
pepper
part
XXXXXX
resco
nfudre
aptr
sett
oresuc
XXXXXX

Sample Output

score
******
refund
******
part
tarp
trap
******
NOT A VALID WORD
******
course
******