HDU-1113（map的运用）

Word Amalgamation

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

******

 

分析：题意是给你一个单词字典，每次询问一串字符，问能否组成字典里的单词，并按字典序输出。这题开始尝试暴力查找，但没注意到要按字典序，后来尝试用set，但第三个样例出错了，怎么也想不通，最后换成map，把字典里的每个单词里的字符排序并与原单词对应，然后查找时排个序再比较就很方便了。

最后说一句，map大法好~~~

 

 #include <cstdio>
 #include <cmath>
 #include <cstring>
 #include <ctime>
 #include <iostream>
 #include <algorithm>
 #include <set>
 #include <vector>
 #include <sstream>
 #include <queue>
 #include <typeinfo>
 #include <fstream>
 #include <map>
 #include <stack>
 using namespace std;
 #define INF -100000
 typedef long long ll;
 const int maxn=;
 string words,tmp,query;
 map<string,string> ans;
 int main()
 {
 //    freopen("in.txt","r",stdin);
 //    freopen("out.txt","w",stdout);
     while(cin>>words){
         if(words=="XXXXXX") break;
         tmp=words;
         sort(words.begin(),words.end());
         ans[tmp]=words;
     }
     while(cin>>query){
         if(query=="XXXXXX") break;
         int flag=;
         sort(query.begin(),query.end());
         for(map<string,string>::iterator it=ans.begin();it!=ans.end();it++)
             if(it->second==query){
                 cout<<it->first<<endl;
                 flag=;
             }
         if(!flag) printf("NOT A VALID WORD\n");
         printf("******\n");
     }
     return ;
 }