HDU 1113 Word Amalgamation

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1113

Word Amalgamation

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2696    Accepted Submission(s): 1291

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

先给你一部字典，然后查字典，查出所有与其某个排列相同的单词，如果查到就按字典序输出。

#include<iostream>
#include<map>
#include<algorithm>
using namespace std;
struct node
{
    string id;
    string s[105];
    int pos;
}a[105];
int main()
{
    string s,str;
    map<string,int>m;
    int cnt=0;
    for(int i=0;i<105;i++) a[i].pos=0;
    while(cin>>s&&s!="XXXXXX")
    {
        str=s;
        sort(str.begin(),str.end());
        if(m.find(str)!=m.end())
        {
            int p=m[str];
            a[p].s[a[p].pos++]=s;
        }
        else
        {
            m[str]=cnt;
            a[cnt].s[a[cnt].pos++]=s;
            a[cnt].id=str;
            cnt++;
        }
    }
    while(cin>>s&&s!="XXXXXX")
    {
        sort(s.begin(),s.end());
        if(m.find(s)!=m.end())
        {
            int p=m[s];
            sort(a[p].s,a[p].s+a[p].pos);
            for(int i=0;i<a[p].pos;i++)
                cout<<a[p].s[i]<<endl;
        }
        else cout<<"NOT A VALID WORD"<<endl;
        cout<<"******"<<endl;
    }
    return 0;
}