A10909. Mike and palindrome
编程题
普及/提高-
知识点
题目描述
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.
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.
输入格式
The first and single line contains string $s$ ( $1<=|s|<=15$ ).
输出格式
Print "YES" (without quotes) if Mike can change exactly one character so that the resulting string is palindrome or "NO" (without quotes) otherwise.
输入输出样例
输入 #1
abccaa
输出 #1
YES
输入 #2
abbcca
输出 #2
NO
输入 #3
abcda
输出 #3
YES