poj 1035
来源:互联网 发布:2017淘宝大学免费课程 编辑:程序博客网 时间:2024/05/01 12:19
Spell checker
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19044 Accepted: 6959
Description
You, 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.
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.
Input
The 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.
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.
Output
Write 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 then write 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 the input file). If there are no replacements for this word then the line feed should immediately follow the colon.
Sample Input
iishashavebemymorecontestmetooifaward#meawaremcontesthavooorifimre#
Sample Output
me is correctaware: awardm: i my mecontest is correcthav: has haveoo: tooor:i is correctfi: imre: more me
Source
Northeastern Europe 1998
直接暴力了
AC代码:
#include<iostream>#include<map>#include<string>#include<cstring>#include<algorithm>#include<stdio.h>using namespace std;string str[10010];int judge1(string s1,string s2){ int c,i; c=0; for(int i=0;i<s1.length() && i+c<s1.length();){ if(s1[i+c]==s2[i]) i++; else c++; } return 2-c;}int judge2(string s1,string s2){ int i,c; c=0; for(i=0;i<s1.length();i++) if(s1[i]!=s2[i]) c++; return 2-c;}int main(){ string s; int i,j; j=0; while(cin>>s && s[0]!='#'){ str[j++]=s; } while(cin>>s && s[0]!='#'){ for(i=0;i<j;i++){ if(str[i]==s){ cout<<s<<" is correct"<<endl; break; } } if(i>=j){ cout<<s<<':'; for(i=0;i<j;i++){ if(str[i].length()==s.length()){ if(judge2(s,str[i])==1){ cout<<' '<<str[i]; } } else{ if(str[i].length()>s.length()){ if(judge1(str[i],s)==1){ cout<<' '<<str[i]; } } else{ if(judge1(s,str[i])==1){ cout<<' '<<str[i]; } } } } cout<<endl; } } return 0;}
0 0
- POJ 1035
- Poj 1035
- POJ 1035
- poj 1035
- poj 1035
- poj 1035
- poj 1035
- POJ 1035
- poj.1035
- poj-1035
- poj 1035
- poj 1035
- poj 1035
- POJ 1035
- POJ 1035
- poj 1035
- poj-1035-Spell checker
- poj 1035 Spell checker
- 是否大商股份喜欢是个
- nginx防御ab,webbench,jmeter攻击
- 士大夫敢死队风格的和三
- uva11151Longest Palindrome(递推)
- C语言 05
- poj 1035
- 移动端web木前途
- Android学习路线(二)创建Android项目
- 微信怎么玩?看看你是不是微信的小白——利川百姓网
- [C#] as 和 is 运算符以及安全的类型强制转换
- STL
- 微信怎么玩?看看你是不是微信的小白——利川百姓网
- Group By 和Having总结
- hdu 4612 Warm up 有重边的tarjan