http://poj.org/problem?id=1035
2014-08-03 10:21
253 查看
Spell checker
DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms. If the word is absent in the dictionary then it can be replaced by correct words (from the dictionary) that can be obtained by one of the following operations: ?deleting of one letter from the word; ?replacing of one letter in the word with an arbitrary letter; ?inserting of one arbitrary letter into the word. Your task is to write the program that will find all possible replacements from the dictionary for every given word. InputThe first part of the input file contains all words from the dictionary. Each word occupies its own line. This part is finished by the single character '#' on a separate line. All words are different. There will be at most 10000 words in the dictionary. The next part of the file contains all words that are to be checked. Each word occupies its own line. This part is also finished by the single character '#' on a separate line. There will be at most 50 words that are to be checked. All words in the input file (words from the dictionary and words to be checked) consist only of small alphabetic characters and each one contains 15 characters at most. OutputWrite to the output file exactly one line for every checked word in the order of their appearance in the second part of the input file. If the word is correct (i.e. it exists in the dictionary) write the message: " is correct". If the word is not correct thenwrite this word first, then write the character ':' (colon), and after a single space write all its possible replacements, separated by spaces. The replacements should be written in the order of their appearance in the dictionary (in the first part of theinput file). If there are no replacements for this word then the line feed should immediately follow the colon.Sample Input
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 19066 | Accepted: 6970 |
i is has have be my more contest me too if award # me aware m contest hav oo or i fi mre #Sample Output
me is correct aware: award m: i my me contest is correct hav: has have oo: too or: i is correct fi: i mre: more me
#include <iostream>#include <cstdio>#include <cstring>using namespace std;char words[10005][20];int n_words = 0;void replace_word(char *str, int i) {int len = strlen(words[i]);int cnt = 0;for (int j = 0; j < len; j ++) {if (str[j] != words[i][j]) cnt ++;}if (cnt == 1) printf(" %s", words[i]);}void add_word(char *str, int i) {int len = strlen(str);int flag = 1;for (int j = 0; j <= len; j ++) {flag = 1;for (int k = 0; k < strlen(words[i]); k ++) {if (k < j && str[k] != words[i][k]) {flag = 0;break;} else if (k > j && str[k-1] != words[i][k]) {flag = 0;break;}}if (flag) {printf(" %s", words[i]);return ;}}}void delete_word(char *str, int i) {int len = strlen(str);int flag = 1;for (int j = 0; j < len; j ++) {flag = 1;for (int k = 0; k < len; k ++) {if (k < j && str[k] != words[i][k]) {flag = 0;break;} else if (k > j && str[k] != words[i][k-1]) {flag = 0;break;}}if (flag) {printf(" %s", words[i]);return ;}}}int main() {char str[20];while (scanf("%s", str), str[0] != '#') {strcpy(words[n_words ++], str);}int len;while (scanf("%s", str), str[0] != '#') {int flag = 0;for (int i = 0; i < n_words; i ++) {if (strcmp(str, words[i]) == 0) {printf("%s is correct\n", str);flag = 1;break;}}if (flag) continue;printf("%s:", str);len = strlen(str);for (int i = 0; i < n_words; i ++) {if (len == strlen(words[i])) {replace_word(str, i);} else if (len - 1 == strlen(words[i])) {delete_word(str, i);} else if (len + 1 == strlen(words[i])) {add_word(str, i);}}printf("\n");}return 0;}
相关文章推荐
- http://poj.org/problem?id=2983
- http://poj.org/problem?id=1975&&同上
- http://poj.org/problem?id=3233
- 贪心+乱搞——最高的牛http://poj.org/problem?id=3263
- http://poj.org/problem?id=2406
- http://poj.org/problem?id=1287&&prim
- http://poj.org/problem?id=1273
- http://poj.org/problem?id=1201
- http://poj.org/problem?id=2075
- http://poj.org/problem?id=2239&&Selecting Courses
- http://poj.org/problem?id=1062
- pku1276 Cash Machine(http://poj.org/problem?id=1276)
- http://poj.org/problem?id=3281
- http://poj.org/problem?id=1466&&Girls and Boys
- http://poj.org/problem?id=1486
- (博客搬迁)pku2231 Moo Volume(数学题http://poj.org/problem?id=2231)
- (博客搬迁啦)pku1276多重背包问题(http://poj.org/problem?id=1276)
- http://poj.org/problem?id=3461&&kmp
- http://poj.org/problem?id=1861&&Kursal
- http://poj.org/problem?id=3259