ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) A Palindromic Supersequence(代

Posted Visitor

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) A Palindromic Supersequence(代相关的知识,希望对你有一定的参考价值。

【链接】 我是链接,点我呀:)
【题意】


在这里输入题意

【题解】


字符串倒着加到原串右边就好

【代码】



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

int main(){
    #ifdef LOCAL_DEFINE
        freopen("rush_in.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(0),cin.tie(0);
    string s;
    cin >> s;
    cout<<s;
    reverse(s.begin(),s.end());
    cout<<s<<endl;
    return 0;
}

以上是关于ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) A Palindromic Supersequence(代的主要内容,如果未能解决你的问题,请参考以下文章

ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) DTree

ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) A Palindromic Supersequence(代

ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) ---d

ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) C Permutation Cycle

ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) A

ICM Technex 2017 and Codeforces Round #400 (Div. 1 + Div. 2, combined) D