CF 505A Mr. Kitayuta&amp;#39;s Gift(暴力)

最新推荐文章于 2026-06-12 09:17:58 发布

转载最新推荐文章于 2026-06-12 09:17:58 发布 · 245 阅读

本文介绍了一种通过在给定字符串中插入一个英文字母使其变为回文串的方法，并提供了一个简单的C++实现示例。该算法适用于长度不超过10的字符串，通过遍历所有可能的插入位置和字符来寻找可行解。

题意在一个字符串中插入一个字母使其变成一个回文串可以的话输出这个回文串否则NA

大水题插入情况最多就26*11种可以直接暴力

#include

#include

using namespace std;

const int N = 20;

char s[N], p[N];

int l;

bool ispal()

{

for(int i = 0; i < (l + 1) / 2; ++i)

if(p[i] != p[l - i]) return false;

return true;

}

int main()

{

int i, j, k;

scanf("%s", s);

l = strlen(s);

for(char c = 'a'; c <= 'z'; ++c)

{

for(k = 0; k <= l; ++k)

{

i = j = -1;

while(i < k - 1) p[++j] = s[++i];

p[++j] = c;

while(i < l - 1) p[++j] = s[++i];

if(ispal())

{

printf("%s\n", p);

return 0;

}

}

}

printf("NA\n");

return 0;

}

复制代码

A. Mr. Kitayuta's Gift Mr. Kitayuta has kindly given you a string s consisting of lowercase English letters. You are asked to insert exactly one lowercase English letter into s to make it a palindrome. A palindrome is a string that reads the same forward and backward. For example, "noon", "testset" and "a" are all palindromes, while "test" and "kitayuta" are not.

You can choose any lowercase English letter, and insert it to any position of s, possibly to the beginning or the end of s. You have to insert a letter even if the given string is already a palindrome.

If it is possible to insert one lowercase English letter into s so that the resulting string will be a palindrome, print the string after the insertion. Otherwise, print "NA" (without quotes, case-sensitive). In case there is more than one palindrome that can be obtained, you are allowed to print any of them.

Input

The only line of the input contains a string s (1?≤?|s|?≤?10). Each character in s is a lowercase English letter.

Output

If it is possible to turn s into a palindrome by inserting one lowercase English letter, print the resulting string in a single line. Otherwise, print "NA" (without quotes, case-sensitive). In case there is more than one solution, any of them will be accepted.

Sample test(s) input

revive

[/code]

output

reviver

[/code]

input

ee

[/code]

output

eye[/code]

input

kitayuta

[/code]

output

NA[/code]

文章由 http://yy.china.com.cn/shnk/xb/整编转载