798A - Mike and palindrome - CodeForces Solution

brute force constructive algorithms strings *1000

Please click on ads to support us..

Python Code: 



import math
string = input()

count=0

for i in range(math.ceil(len(string)/2)):
    if string[i] != string[len(string)-i-1]:
        count+=1


if count==1:
    print("YES")
elif len(string)%2==1 and count==0:
    print("YES")
else:
    print("NO")

C++ Code: 

#include<iostream>
#include<algorithm>
using namespace std;

int main()
{
    int i,j,c=0;
    string x;
    cin>>x;
    int len=x.length();

    for(i=0, j=len-1; i<j; i++, j--)
        c+=x[i]!=x[j];

    if(c==1 || (c==0 && len%2==1))
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
    return 0;
}


Comments

Submit
0 Comments
More Questions

1608B - Build the Permutation
1505A - Is it rated - 2
169A - Chores
765A - Neverending competitions
1303A - Erasing Zeroes
1005B - Delete from the Left
94A - Restoring Password
1529B - Sifid and Strange Subsequences
1455C - Ping-pong
1644C - Increase Subarray Sums
1433A - Boring Apartments
1428B - Belted Rooms
519B - A and B and Compilation Errors
1152B - Neko Performs Cat Furrier Transform
1411A - In-game Chat
119A - Epic Game
703A - Mishka and Game
1504C - Balance the Bits
988A - Diverse Team
1312B - Bogosort
1616B - Mirror in the String
1660C - Get an Even String
489B - BerSU Ball
977C - Less or Equal
1505C - Fibonacci Words
1660A - Vasya and Coins
1660E - Matrix and Shifts
1293B - JOE is on TV
1584A - Mathematical Addition
1660B - Vlad and Candies