HDU 1113 Word Amalgamation(字符串&&STL)
来源:互联网 发布:以后别做朋友知乎 编辑:程序博客网 时间:2024/05/18 03:49
address: http://acm.hdu.edu.cn/showproblem.php?pid=1113
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******
code :
#include <iostream>#include <string.h>#include <cstdio>#include <algorithm>#include <map>using namespace std;int main(){ string a,b; map<string,string>st; while (cin>>a&&a!="XXXXXX") { int n; b = a; // n = strlen(a); sort(a.begin(),a.end()); st[b] = a; } while (cin>>a&&a!="XXXXXX") { int flag=0; b = a; // n = strlen (a); sort(a.begin(),a.end()); map<string, string>::iterator it; for (it=st.begin(); it!=st.end(); ++it) { if (it->second==a) { cout<<it->first<<endl; flag=1; } } if (flag==0) cout<<"NOT A VALID WORD"<<endl; cout<<"******"<<endl; } return 0;}
- HDU 1113 Word Amalgamation(字符串&&STL)
- HDU 1113 Word Amalgamation -- 字符串处理+排序
- HDU 1113 Word Amalgamation
- hdu 1113 Word Amalgamation
- hdu(1113)Word Amalgamation
- HDU 1113 Word Amalgamation
- hdu 1113 Word Amalgamation
- HDU 1113 Word Amalgamation
- HDU 1113-Word Amalgamation
- hdu 1113 Word Amalgamation
- hdu 1113 Word Amalgamation
- hdu 1113 Word Amalgamation
- hdu-1113 Word Amalgamation
- HDU 1113 Word Amalgamation
- HDU 1113 Word Amalgamation
- hdu 1113 Word Amalgamation(单词重排)
- POJ 1318 Word Amalgamation (字符串 STL大水)
- hdu 1113 Word Amalgamation 字符串处理 ,加上哈希 ,水题~
- 深入学习Java之Vector
- NMOS管2种接法差异总结
- health2.0——获取微信信息
- sed命令
- python 网络爬虫与信息采取之解析网页(一)--BeautifulSoup库
- HDU 1113 Word Amalgamation(字符串&&STL)
- 什么是 C#.net-
- 如何判断chrome浏览器
- 访问修饰符与方法重写
- 收好,带"\t"的九九乘法表
- 两不同程序之间通讯
- Hbase学习笔记:初识HBase
- 如何用Java实现邮件发送?---- 网站通过邮箱激活底层代码
- 解析json