HDU1113 Word Amalgamation
来源:互联网 发布:app 实时数据展示页面 编辑:程序博客网 时间:2024/06/01 13:07
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******
Attention:对若干个字符串进行字典排序,应用结构体数组储存字符串(二维数组会报错),以用函数 sort 进行排序。
Code:
#include <iostream>#include <algorithm>#include <stdio.h>#include <cstdlib>#include <cstring>#include <cmath>#include <ctime>#include <ctype.h>using namespace std;char wd[100][15],wd_sort[100][15];struct w{ char res[15];}wd_rs[100];bool cmp(struct w a,struct w b){ return strcmp(a.res,b.res)<0;}int main(){ char wt[15]; int len=0; while(scanf("%s",wt)&&strcmp(wt,"XXXXXX")) { strcpy(wd[len],wt); strcpy(wd_sort[len],wd[len]); len++; } int k=len; while(k--) { sort(wd_sort[k],wd_sort[k]+strlen(wd_sort[k])); } char w[15]; while(scanf("%s",w)&&strcmp(w,"XXXXXX")) { sort(w,w+strlen(w)); int flag=0,z=0; k=len; for(int i=0;i<=k;i++) { if(strcmp(wd_sort[i],w)==0) { strcpy(wd_rs[z++].res,wd[i]); flag=1; } } if(!flag) printf("NOT A VALID WORD\n"); else { sort(wd_rs,wd_rs+z,cmp); for(int i=0;i<z;i++) printf("%s\n",wd_rs[i].res); } printf("******\n"); } return 0;}
阅读全文
0 0
- hdu1113 Word Amalgamation
- Word Amalgamation hdu1113
- HDU1113 Word Amalgamation
- HDU1113 POJ1318 UVA642 ZOJ1181 Word Amalgamation
- hdu1113 Word Amalgamation(详细解释--map和string的运用)
- Word Amalgamation
- Word Amalgamation
- Word Amalgamation
- HDU1113
- Word Amalgamation源程序
- fjnu 1147 Word Amalgamation
- POJ1318 Word Amalgamation
- POJ 1318 Word Amalgamation
- ZOJ 1181Word Amalgamation
- POJ 1318 Word Amalgamation
- poj 1318 Word Amalgamation
- 1318 Word Amalgamation
- POJ 1113 Word Amalgamation
- nodeJs 实现爬取网页信息
- TensorFlow微调AlexNet
- 《算法竞赛入门经典》之开发环境与方法小收获
- 网站添加快捷方式到电脑桌面之PHP方法
- spring集成mybatis后,打印SQL语句
- HDU1113 Word Amalgamation
- 习题2-6_排列(permutation)
- jquery zTree控件,以及zTree的回调函数,即zTree的JavaScript事件
- HDU1015 Safecracker
- mycat join
- Effective 34 Note which algorithms expect sorted ranges
- HDU1027 Ignatius and the Princess II
- 欢迎来辩到底要不要用黄金分割?
- Java中ArrayList和LinkedList区别