fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int solve(string s,string t,int i,int n)
  4. {
  5. int swaps=0;
  6. int sBigger = false;
  7. if(s[i]>t[i])
  8. sBigger = true;
  9. i++;
  10. while(i<n)
  11. {
  12. if(sBigger){
  13. if(s[i]>t[i])
  14. swaps++;
  15.  
  16. } else//sBigger false then means t starting is bigger so if t[i]>s[i] do swaps
  17. {
  18. if(s[i]<t[i])
  19. {
  20. swaps++;
  21.  
  22. }
  23.  
  24. }
  25. i++;
  26. }
  27. return swaps;
  28. }
  29. int main() {
  30. // your code goes here
  31. string s1,s2;
  32. cin>>s1>>s2;
  33. int i=0;
  34. int n = s1.size();
  35. while(i<n && s1[i]==s2[i])
  36. {
  37. i++;
  38. }
  39. int way1 = solve(s1,s2,i,n);
  40. int way2 = 1+solve(s1,s2,i,n);
  41. cout<<min(way1,way2);
  42. return 0;
  43.  
  44. }
  45.  
Success #stdin #stdout 0s 5288KB
stdin
64
22
stdout
1