Mike and palindrome CodeForces - 798A

WA你离我远点

于 2018-08-29 19:21:02 发布

阅读量194

点赞数

分类专栏： CF 日场比赛

本文链接：https://blog.youkuaiyun.com/qq_41524782/article/details/82191197

版权

日场比赛同时被 2 个专栏收录

129 篇文章

订阅专栏

27 篇文章

订阅专栏

博客围绕判断字符串问题展开，给定仅含小写英文字母的字符串，要求判断能否恰好改变一个字符使其成为回文串。介绍了回文串定义，给出输入输出要求及示例，还提及对应代码需分奇数和偶数情况处理。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Mike has a string s consisting of only lowercase English letters. He wants to change exactly onecharacter 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

abccaa

Output

YES

Input

abbcca

Output

NO

Input

abcda

Output

YES

A代码（分奇数和偶数，恰好改变一次）

Select Code

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    char a[30];
    int n, i, h = 0, j;
    scanf("%s",a);
    n = strlen(a);
    for(i = 0,j = n-1;i<=j;i++,j--)
    {
        if(a[i]!=a[j])
            h++;
    }
    if((n%2==0&&h==1)||(n%2==1&&h<=1))
        printf("YES\n");
    else
        printf("NO\n");
    return 0;
}