Preparando MOJI

Mike and palindrome

2000ms 262144K

Description:

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.

Sample Input:

abccaa

Sample Output:

YES

Sample Input:

abbcca

Sample Output:

NO

Sample Input:

abcda

Sample Output:

YES

Informação

Codeforces

Provedor Codeforces

Código CF798A

Tags

brute forceconstructive algorithmsstrings

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:14:39

Relacionados

Nada ainda