Advertisement
Guest User

Untitled

a guest
Jul 16th, 2018
74
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.59 KB | None | 0 0
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define maxn 200002
  4.  
  5. int n, odp;
  6. string a, b;
  7.  
  8. int main(){
  9. cin>>n;
  10. cin>>a>>b;
  11. a='#'+a;
  12. b='#'+b;
  13. for(int i=1; i<=n; i++){
  14. if(a[i]!=b[i]){
  15. bool ok=0;
  16. if(i<=(n/2)){
  17. if(a[n-i+1]==b[i]){
  18. a[n-i+1]=a[i];
  19. ok=1;
  20. }
  21. else if(b[n-i+1]==b[i]){
  22. b[n-i+1]=a[i];
  23. ok=1;
  24. }
  25. if(ok==0){
  26. if(a[n-i+1]==a[i] && b[n-i+1]==b[i]){
  27. a[n-i+1]=b[i];
  28. ok=1;
  29. }
  30. else if(b[n-i+1]==a[i]){
  31. b[n-i+1]=b[i];
  32. ok=1;
  33. }
  34. }
  35. }
  36. if(ok==0) odp++;
  37. }
  38. }
  39. cout<<odp;
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement