CF463 A题Palindromic Supersequence

本文介绍了一种算法,用于将给定的字符串转换为回文形式的超序列,确保原字符串为新序列的子序列,并且长度不超过10^4。通过判断原字符串是否为回文来决定直接输出还是进行转换。

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

Palindromic Supersequence
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a string A. Find a string B, where B is a palindrome and A is a subsequence of B.

A subsequence of a string is a string that can be derived from it by deleting some (not necessarily consecutive) characters without changing the order of the remaining characters. For example, "cotst" is a subsequence of "contest".

A palindrome is a string that reads the same forward or backward.

The length of string B should be at most 104. It is guaranteed that there always exists such string.

You do not need to find the shortest answer, the only restriction is that the length of string B should not exceed 104.

Input

First line contains a string A (1 ≤ |A| ≤ 103) consisting of lowercase Latin letters, where |A| is a length of A.

Output

Output single line containing B consisting of only lowercase Latin letters. You do not need to find the shortest answer, the only restriction is that the length of string B should not exceed 104. If there are many possible B, print any of them.

Examples
input
aba
output
aba
input
ab
output
aabaa
Note

In the first example, "aba" is a subsequence of "aba" which is a palindrome.

In the second example, "ab" is a subsequence of "aabaa" which is a palindrome.

题意是给出一个字符串A,判断它是否回文,是的话输出,否则把它变成回文再输出。

#include<iostream>
#include<cstring>
#include<string>
using namespace std;
int judge(string a)
{ int l=a.length();
    for(int i=0;i<l;i++)
    {
        if(a[i]==a[l-i-1])
        {

        }
        else return 0;
        if(i==l/2+1)
            return 1;
    }
    return 1;
}
int main()
{
string a;
string b;
string c;
cin>>a;
b.assign(a.rbegin(),a.rend());
if(judge(a))
    cout<<a<<endl;
else
{
c=a+b;
if(c.length()<10000)
cout<<c<<endl;

}
return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值