A. Mike and palindrome
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Mike 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.
Examples
input
Copy
abccaa
output
Copy
YES
input
Copy
abbcca
output
Copy
NO
input
Copy
abcda
output
Copy
YES
水题,直接放代码:
#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
char c[20];
int main()
{
gets(c);
int s=0;
int l=strlen(c);
for(int i=0;i<l/2;i++)
{
if(c[i]!=c[l-i-1])
{
s++;
}
}
if(s<=1)
{
if(s==0)
{
if(l%2==0) cout<<"NO"<<endl;
else cout<<"YES"<<endl;
}
else if(s==1)
{
cout<<"YES"<<endl;
}
}
else printf("NO\n");
return 0;
}