水题,分类讨论,模拟一下就行
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <queue>
#include <cstring>
#include <vector>
using namespace std;
char A[105], B[105];
int n1, n2;
int main()
{
//freopen("input.txt", "r", stdin);
scanf("%s%s", A, B);
bool match = true;
n1 = strlen(A);
n2 = strlen(B);
if (n1 < 8)
{
if (n1 != n2)
{
match = false;
}
else
{
for (int i = 0; i < n1; ++i)
{
if (A[i] != B[i])
{
match = false;
break;
}
}
}
}
else
{
if (n1 == n2)
{
int wrong = 0;
for (int i = 0; i < n1; ++i)
{
if (A[i] != B[i])
{
wrong++;
}
}
if (wrong <= 1)
match = true;
else
match = false;
}
else if (n2 == n1 - 1)
{
bool dropped = false;
for (int i = 0, j = 0; i <= n1&&j <= n2; ++i, ++j)
{
if (A[i] != B[j])
{
if (dropped)
{
match = false;
break;
}
else
{
dropped = true;
--j;
}
}
}
}
else
match = false;
}
if (match)
printf("yes\n");
else
printf("no\n");
//system("pause");
//while (1);
return 0;
}