Word Amalgamation(poj1318) 解题报告
来源:互联网 发布:怎么看java源码 编辑:程序博客网 时间:2024/09/21 09:02
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******
解题思路:主要是和知道的字符串进行匹配,选出符合要求的,按题目要求对字典库进行排序,然后 就是输入数据的问题了,要和他们一个个比较,可以对他们字符串排序,这样就方便操作,同时快速 解决问题,只要对他们字符串对比就知道了,没什么困难的。 代码如下:
- #include<iostream>
- #include <algorithm>
- using namespace std;
- char data[105][10],s[10],temp[10];
- int cmp(const void *a,const void *b)
- {
- return(strcmp((char*)a,(char*)b));
- }
- int main()
- {
- int i=0;
- while(1)
- {
- cin>>data[i];
- if(data[i][0]=='X')
- break;
- else
- i++;
- }
- qsort(data,i,sizeof(data[0]),cmp);
- while(1)
- {
- cin>>s;
- if(s[0]=='X')
- break;
- sort(s,s+strlen(s));
- int flag=0;
- for(int j=0;j<i;j++)
- {
- strcpy(temp,data[j]);
- sort(temp,temp+strlen(temp));
- if(!strcmp(s,temp))
- {
- flag=1;
- cout<<data[j]<<endl;
- }
- }
- if(flag==0)
- cout<<"NOT A VALID WORD"<<endl;
- cout<<"******"<<endl;
- }
- return 0;
- }
- Word Amalgamation(poj1318) 解题报告
- POJ1318 Word Amalgamation
- POJ1318 Word Amalgamation
- POJ1318 Word Amalgamation 简单模拟
- POJ1318解题报告
- HDU1113 POJ1318 UVA642 ZOJ1181 Word Amalgamation
- poj 1318(Word Amalgamation)
- Word Amalgamation
- Word Amalgamation
- Word Amalgamation
- Word Pattern解题报告
- word break解题报告
- ZOJ 1181 Word Amalgamation(单词融合)
- POJ 1318 Word Amalgamation (模拟)
- hdu 1113 Word Amalgamation(单词重排)
- POJ 1318 Word Amalgamation (简单题)
- HDU 1113 Word Amalgamation(字符串&&STL)
- Leetcode Word Search 解题报告
- JAVA中,构造方法与实例方法的区别
- 很高兴
- 刚开始学~不知晚不晚?
- Sum
- poj1328 Radar Installation 解题报告
- Word Amalgamation(poj1318) 解题报告
- 滑雪 poj1088 解题报告
- Intervals poj1089 解题报告
- 一个很不愿意去想的问题!
- 太麻烦
- 新手报到
- 1008p
- 明天就是新的一周了
- 让你的游戏运行不起来(不知道的看看)