Submission

[-SSSSSSSSS]

Score: 0

User: NTMP

Problemset: 04.Corretc the wodr

Language: cpp

Time: 0.002 second

Submitted On: 2025-04-17 12:56:07

#include <bits/stdc++.h>
using namespace std;

int main(){
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  while(n--){
    string s1,s2; cin >> s1 >> s2;
    int suma = 0, sumb = 0;
    for(auto i : s1){
      suma+=i;
    }
    for(auto i : s2){
      sumb+=i;
    }
    if(suma != sumb){
      cout << "Cannot transform to " << s1 <<'\n';
      continue;
    }
    int cnt = 0;
    for(int i=0;i<s1.size();i++){
      if(s1[i] != s2[i]){
        for(int j=i+1;j<s1.size();j++){
          if(s1[j] == s2[i] && s1[i] == s2[j]){
            cnt++;
            swap(s2[i],s2[j]);
            break;
          }
        }
      }
    }
    int rem = 0;
    for(int i=0;i<s1.size();i++){
      if(s1[i] != s2[i]){
        rem++;
      }
    }
    if(rem) {
      cout<<cnt+rem-1<<'\n';
      continue;
    }
    // cout<<"cnt "<<cnt<<" rem "<<rem<<endl;
    cout<<cnt<<'\n';
  }
}