B3958求调

#include<bits/stdc++.h>
using namespace std;
int t,la,lb;
string a,b;
bool check(){
	bool f=0;
	if(abs(la-lb)>1)return 0;
	for(int i=0;i<min(la,lb);i++){
		if(la!=lb&&a[i]!=b[i])
			if(a[i+1]!=b[i]&&a[i]!=b[i+1])return 0;
		if(f==1&&a[i]!=b[i])return 0;
		if(a[i]!=b[i])f=1;
	}
	return 1;
}
int main(){
	ios::sync_with_stdio(0);
	cin>>t;
	while(t--){
		cin>>a>>b;
		la=a.size(),lb=b.size();
		if(check())cout<<"similar\n";
		else cout<<"not similar\n";
	}
	return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define ll long long
int n;
signed main(){
	cin >> n;
	while (n--){
		string a , b;
		cin >> a >> b;
		int la = a.size();
		int lb = b.size();
		if (la < lb){
			swap(a , b);
			swap(la , lb);
		}
		if (abs(la - lb) > 1){
			cout << "not similar" << endl;
			continue;
		}
		else if (abs(la - lb) == 1){
			int f = 0;
			int ans = 0;
			for (int i = 0 ; i < lb ; i++){
				if(a[i] != b[i]){
					ans = 1;
				}
				if (ans && a[i + 1] != b[i]){
					cout << "not similar" << endl;
					f = 1;
					break;
				}
			}
			if (!f){
				cout << "similar" << endl;
			}
		}
		else if (la == lb){
			bool ans = 0;
			bool f = 0;
			for (int i = 0 ; i < lb ; i++){
				if (a[i] != b[i]){
					if (ans){
						f = 1;
						cout << "not similar" << endl;
						break;
					}
					else {
						ans = 1;
					}
				}
			}
			if (!f){
				cout << "similar" << endl;
			}
		}
	}
	return 0;
}