ike has a string s consisting of only lowercase English letters. He wants to change exactly one character from the string so that the resulting one is a palindrome.
A palindrome is a string that reads the same backward as forward, for example strings "z", "aaa", "aba", "abccba" are palindromes, but strings "codeforces", "reality", "ab" are not.
Input
The first and single line contains string s (1 ≤ |s| ≤ 15).
Output
Print "YES" (without quotes) if Mike can change exactly one character so that the resulting string is palindrome or "NO" (without quotes) otherwise.
Example
Input
abccaa
Output
YES
Input
abbcca
Output
NO
Input
abcda
Output
YES
分奇偶奇偶~~~~
注意奇数时候
他中间呢个可以变的呢
奇数的回文串变一个还回文诶嘤嘤嘤
WAWAWA:::::::
!!//WAWAWA:::::::
#include <iostream>
#include <string>
using namespace std;
string s;
int main()
{
cin >> s;
int cnt = 0;
int len = s.size();
for (int i = 0;i<len/2;i++)
if (s[i] != s[len - i - 1])
cnt++;
if (cnt == 1) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}
//ACACAC:::::::::::::
#include <iostream>
#include <string>
using namespace std;
string s;
int main()
{
cin >> s;
int cnt = 0;
int len = s.size();
for (int i = 0;i<len/2;i++)
if (s[i] != s[len - i - 1])
cnt++;
if (cnt == 1||(s.size()%2==1 && cnt==0)) {
cout << "YES";
return 0;
}
cout << "NO";
return 0;
}