UVa OJ 642 Word Amalgamation
来源:互联网 发布:网络上粑粑什么意思 编辑:程序博客网 时间:2024/05/17 18:44
Word Amalgamation
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 file 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 <cstdio>#include <cstdlib>#include <cstring>char dic[101][7];void bubble_sort(char s[], int n){ for (int i = 0; i < n; ++i) { for (int j = i+1; j < n; ++j) { if (s[i] > s[j]) { char t = s[i]; s[i] = s[j]; s[j] = t; } } }}void dic_sort(char dic[][7], int n){ for (int i = 0; i < n; ++i) { for (int j = i+1; j < n; ++j) { if (strcmp(dic[i], dic[j]) > 0) { char t[7]; strcpy(t, dic[i]); strcpy(dic[i], dic[j]); strcpy(dic[j], t); } } } }bool cmp_words(const char word1[7], const char word2[7]){ char w1[7], w2[7]; strcpy(w1, word1); strcpy(w2, word2); int n1 = strlen(w1), n2 = strlen(w2); bubble_sort(w1, n1); bubble_sort(w2, n2); return strcmp(w1, w2) == 0;}int main(){ int count = 0; char word[7] = ""; while (scanf("%s", dic[count]) == 1 && strcmp(dic[count], "XXXXXX") != 0) { ++count; } dic_sort(dic, count); while (scanf("%s", word) == 1 && strcmp(word, "XXXXXX") != 0) { bool found = false; for (int i = 0; i < count; ++i) { if (cmp_words(word, dic[i]) == true) { printf("%s\n", dic[i]); if (!found) found = true; } } if (!found) printf("NOT A VALID WORD\n"); printf("******\n"); } return 0;}
0 0
- UVa OJ 642 Word Amalgamation
- UVA 642 - Word Amalgamation
- UVa 642 - Word Amalgamation
- UVa 642 Word Amalgamation
- UVa 642 Word Amalgamation (查字典&字符串排序)
- uva--624Word Amalgamation+dp
- Word Amalgamation
- Word Amalgamation
- Word Amalgamation
- 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
- C# 点绕某点旋转某角度
- Eclipse启动无响应 停留在Loading workbench状态
- kmGLPushMatrix/kmGLPopMatrix概念
- Quadratic Residues
- log4net配置
- UVa OJ 642 Word Amalgamation
- C++运算符优先级
- 703n拆机方法
- 1041.Simple Sorting
- kmGLTranslatef概念(OpenGL)
- redhat超级用户密码破解
- 美国x档案 豆瓣影评 事事无常
- 公司的Java框架应具备的通用功能
- CCDrawingPrimitives/CCDrawNode学习笔记