20分求调
查看原帖
20分求调
1800410
ideas楼主2025/7/24 15:43
#include<iostream>
using namespace std;
#include<string>
int main() {
    int T = 0;
    cin >> T;
    
    while (T--) {
        string A, B ;
        cin >> A >> B;
        if (A.size() < B.size()) {
            swap(A, B);
        }
        if (A.size() - B.size() > 1) {
            cout << "not similar";
            continue;
        }
        else if(A.size()-B.size()==1) {
            int k=0;
            int f=0;
            for (int i = 0;i <B.size() ;i++) {
                if (A[i+k] != B[i]) {
                    k++;
                }
                if (k>1) {
                    cout << "not similar"<<endl;
                    f = 1;
                    break;
                }
            }
            if (f == 0) {
            cout << "similar" << endl;
            }
        }
        
        else if(A.size() == B.size()) {
            int sum = 0;
            for (int i = 0;i < B.size();i++) {
                if (A[i] != B[i]) {
                    sum++;
                }
            }
            if (sum > 1) {
                cout << "not similar" << endl;
            }
            else
            {
                cout << "similar" << endl;
            }

        }
    }
    
    //system("pause");
    return 0;
}
2025/7/24 15:43
加载中...