Word Amalgamation

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
******
    
    

题目大意：给你一堆单词不超过100个作为词典库，遇到XXXXXX时词典库输入结束，开始进行输入单词查找，也是遇到XXXXXX结束输入。单词顺序可以打乱，也就是说只要这个单词的字母跟词典库的可以对应起来就输出词典库中的该单词，如果没有就输出"NOT A VALID WORD每一次输出结果后都输出******。

思路：结构体排序，具体看代码

源代码：

#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <algorithm>
#include <stdlib.h>
#include <cmath>
using namespace std;
struct node
{
    string a;
    string b;
}x[120];
bool cmp(node a,node b)
{
    return a.a<b.a;
}
int main()
{
    string s,t;
    int d=0;
    while(cin >> s)
	{
		if( s == "XXXXXX")
		{
			break;
		}
		x[d].a=s;
		sort(s.begin(),s.end());
		x[d++].b=s;
	}
	sort(x,x+d,cmp);
	while(cin >> s)
	{
		if( s == "XXXXXX")
		{
			break;
		}
		int flag = 0;
		sort(s.begin(),s.end());
		for(int i = 0;i < d;i++)
        {
            if(x[i].b==s)
            {
                cout<<x[i].a<<endl;
                flag=1;
            }
        }
		if(flag == 0)
		cout << "NOT A VALID WORD"<<endl;
		cout << "******"<<endl;
	}
	return 0;
}