poj-1035-Spell Checker

Posted 2020-08-30 zhang--yd

 

Spell checker Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 25156   Accepted: 9213 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.  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.  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 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 Source Northeastern Europe 1998

 

16550786

sunshinestyle

1035

Accepted

928K

110MS

G++

1582B

2017-02-07 11:11:59

 

模拟水题， 按照要求去匹配就行了

 

//p-1035 
#include <iostream> 
#include <cstdio> 
#include <cstdlib>
#include <cstring> 
using namespace std; 
const int MAXN = 20000; 

char str[MAXN][20]; 
int cnt, len[MAXN]; 

int main(){
	freopen("in.txt", "r", stdin); 

	int cnt = 0; 
	while(scanf("%s", str[cnt]) != EOF){
		if(str[cnt][0] == ‘#‘){
			break; 
		}
		len[cnt] = strlen(str[cnt]); 
		cnt++; 
	}
	char st[20]; 
	int st_len; 
	while(scanf("%s", st) != EOF){
		if(st[0] == ‘#‘){
			break; 
		}
		int diff, notfound = 1; 
		for(int i=0; i<cnt; ++i){
			if(strcmp(st, str[i]) == 0){
				printf("%s is correct\n", st);
				notfound = 0; 
				break; 
			}
		}
		if(notfound){
			printf("%s:", st );
			st_len = strlen(st); 
			for(int i=0; i<cnt; ++i){
				if(st_len == len[i]){
					diff = 0; 
					for(int j=0; j<st_len; ++j){
						if(st[j] != str[i][j]) { diff++; }
						if(diff > 1){ break; } 
					}
					if(diff == 1){
						printf(" %s", str[i]);
					}
				}else if(st_len == len[i]+1){
					int j = 0, k= 0; 
					diff = 0; 
					while(j<st_len && k<len[i]){
						if(st[j] == str[i][k]){
							j++; k++; 
						}else{
							j++; diff++; 
						}
						if(diff > 1){ break; }
					}
					if(diff == 1 || (j+1==st_len && diff==0)){
						printf(" %s", str[i]);
					}
				}else if(st_len == (len[i]-1)){
					int j = 0, k = 0; 
					diff = 0; 
					while(j<st_len && k<len[i]){
						if(st[j] == str[i][k]){
							j++; k++; 
						}else{
							k++; diff++; 
						}
						if(diff > 1){ break; }
					}
					if(diff == 1 || ( diff ==0 && k+1==len[i])){
						printf(" %s", str[i]);
					}
				}
			}
			printf("\n");
		}
	}
	return 0; 
}