10分求调

#include<bits/stdc++.h>
using namespace std;
bool f(string a, string b) {
	if (a == b)
		return true;
	if (a.size() < b.size())
		swap(a, b);
	if (a.size() - b.size() > 1)
		return false;
	int i = 0, j = 0;
	while (i < (int)a.size() && j < (int)b.size() && a[i] == b[j]) {
		i++, j++;
	}

	if (i == (int)a.size() || j == (int)b.size())
		return true;
	a += "*", b += "*";
	if (a.size() != b.size() && a[i + 1] == b[j])
		i++;
	else if (a.size() == b.size() && a[i + 1] == b[j + 1])
		i++, j++;
	while (i < (int)a.size() && j < (int)b.size()) {
		if (a[i] != b[i])
			return false;
		i++, j++;
	}
	return true;
}
int main() {
	int t;
	cin >> t;
	while (t--) {
		string a, b;
		cin >> a >> b;
		if (f(a, b))
			cout << "similar" << endl;
		else
			cout << "not similar" << endl;
	}
	return 0;
}