Description
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 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
Sample Input
Sample Output
mre: more me
用了map,然后枚举每个串全部的情况。
实际效率还没有暴力快。
#include<set>
#include<map>
#include<ctime>
#include<cmath>
#include<stack>
#include<queue>
#include<bitset>
#include<cstdio>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#define rep(i,j,k) for (int i = j; i <= k; i++)
#define per(i,j,k) for (int i = j; i >= k; i--)
#define loop(i,j,k) for (int i = j;i != -1; i = k[i])
#define lson x << 1, l, mid
#define rson x << 1 | 1, mid + 1, r
#define fi first
#define se second
#define mp(i,j) make_pair(i,j)
#define pii pair<string,string>
using namespace std;
typedef long long LL;
const int low(int x) { return x&-x; }
const double eps = 1e-8;
const int INF = 0x7FFFFFFF;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const int read()
{
char ch = getchar();
while (ch<'0' || ch>'9') ch = getchar();
int x = ch - '0';
while ((ch = getchar()) >= '0'&&ch <= '9') x = x * 10 + ch - '0';
return x;
}
int T, n;
char g[N][20];
map<string, int> M;
string x;
vector<int> ans;
int main()
{
n = 1;
while (scanf("%s", g[n]), g[n][0] != '#') M[g[n]] = n++;
while (cin >> x, x[0] != '#')
{
if (M[x])
{
cout << x << " is correct" << endl;
continue;
}
ans.clear();
for (int i = 0; i < x.size(); i++)
{
char c = x[i];
rep(j, 0, 25) if (c != 'a' + j)
{
x[i] = 'a' + j;
if (M[x]) ans.push_back(M[x]);
}
x[i] = c;
string q = "";
for (int j = 0; j < x.size(); j++)
{
if (j != i) q = q + x[j];
}
if (M[q]) ans.push_back(M[q]);
}
for (int i = 0; i <= x.size(); i++)
{
string l = "", r = "";
for (int j = 0; j < i; j++) l += x[j];
for (int j = i; j < x.size(); j++) r += x[j];
rep(j, 0, 25)
{
string y = l + (char)('a' + j) + r;
if (M[y]) ans.push_back(M[y]);
}
}
sort(ans.begin(), ans.end());
cout << x << ":";
for (int i = 0; i < ans.size(); i++)
{
if (i && ans[i] == ans[i - 1]) continue;
printf(" %s", g[ans[i]]);
}
putchar(10);
}
return 0;
}