HDU 1113 Word Amalgamation -- 字符串处理+排序

Word Amalgamation

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

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

tarpgivenscorerefundonlytrapworkearncoursepepperpartXXXXXXresconfudreaptrsettoresucXXXXXX

 

Sample Output

score******refund******parttarptrap******NOT A VALID WORD******course******

 

Source

Mid-Central USA 1998

 

Recommend

Eddy   |   We have carefully selected several similar problems for you:  1073 1075 1039 1062 1088 

/*HDU 1113 Word Amalgamationhttp://acm.hdu.edu.cn/showproblem.php?pid=1113*/#include <stdio.h>  #include <string.h>  #include <iostream>#include <string>#include <algorithm>  #include <sstream>#include <vector>#define MAXN 10005    using namespace std;   vector<string> dictionary;bool cmp(char c1 , char c2){return c1 < c2 ;}vector<char> sortAword(string s){int len = s.size();vector<char> vc;for(int i = 0 ;i < len;i++)vc.push_back(s[i]);if(len > 1)sort(vc.begin() , vc.end() , cmp);return vc;}bool isEqu(vector<char> v1,vector<char> v2){int len1 = v1.size();int len2 = v2.size();if(len1 != len2)return false;for(int i = 0 ; i < len1 ;i++){if(v1[i] != v2[i] )return false;}return true;}bool cmp2(string s1,string s2){return s1 < s2;}int main()  {  //freopen("in.txt","r",stdin);string s = "" ;while(cin >> s){if(s == "XXXXXX")break;dictionary.push_back(s);}while(cin >> s){if(s == "XXXXXX")break;vector<string> scrambled;scrambled.clear();for(int i= 0 ;i < (int)dictionary.size();i ++){string sd = dictionary[i];if( isEqu(sortAword(s),sortAword(sd))){scrambled.push_back(sd);}}int lens = scrambled.size();if(lens == 0){cout << "NOT A VALID WORD" <<endl;}else{sort(scrambled.begin(),scrambled.end(),cmp2);for(int j = 0 ;j <  lens;j++){cout << scrambled[j] << endl;}}cout << "******" << endl ;}//printf("");    return 0;  }