HDU1113 POJ1318 UVA642 ZOJ1181 UVALive5328 Word Amalgamation【MAP+排序+水题】
2018-02-10 16:10
393 查看
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
******
refund
******
part
tarp
trap
******
NOT A VALID WORD
******
course
******
tarp given score refund only trap work earn course pepper part XXXXXX resco nfudre aptr sett oresuc XXXXXXSample Output score
******
refund
******
part
tarp
trap
******
NOT A VALID WORD
******
course
******
#include<stdio.h> #include<string.h> #include<iostream> #include<vector> #include<set> #include<map> #include<queue> #include<ctype.h> #include<stack> #include<math.h> #include <string> #include<algorithm> using namespace std; int main() { map<string,string> m; string word,dic; while(cin>>word&&word!="XXXXXX") { dic=word; sort(dic.begin(),dic.end()); m[word]=dic; } while(cin>>dic&&dic!="XXXXXX") { bool flag=true; sort(dic.begin(),dic.end()); for(map<string,string>::iterator iter=m.begin();iter!=m.end();iter++) { if(iter->second==dic) { cout<<iter->first<<endl; flag=false; } } if(flag) cout<<"NOT A VALID WORD"<<endl; cout<<"******"<<endl; } return 0; }
相关文章推荐
- Uva 642 - Word Amalgamation sort qsort
- UVa 642 - Word Amalgamation
- UVa 642 Word Amalgamation (查字典&字符串排序)
- UVa642 - Word Amalgamation
- UVA 642 - Word Amalgamation
- UVa 642 - Word Amalgamation
- UVa 642 - Word Amalgamation
- UVa 642 Word Amalgamation
- ZOJ 1181 Word Amalgamation(单词融合)
- ZOJ 1181 Word Amalgamation
- ZOJ1181 Word Amalgamation 字符串 排序查找
- ZOJ1181 Word Amalgamation 字符串 排序查找
- HDU1128 UVA640 UVALive5326 ZOJ1180 Self Numbers【水题】
- POJ2013 ZOJ2172 UVALive3055 Symmetric Order【递归+堆栈】
- POJ 1511 Invitation Cards / UVA 721 Invitation Cards / SPOJ Invitation / UVAlive Invitation Cards / SCU 1132 Invitation Cards / ZOJ 2008 Invitation Cards / HDU 1535 (图论,最短路径)
- UVALive3093 POJ2105 ZOJ2482 IP Address【进制】
- 【Uvalive3942】Remember the Word——字典树+dp
- hdu1113 Word Amalgamation
- UVALive 3942 - Remember the Word(DP,数组Trie+指针Trie)
- UVALive 3942 Remember the word 字典树 动态规划