zoukankan      html  css  js  c++  java
  • E

    Description

    Pari has a friend who loves palindrome numbers. A palindrome number is a number that reads the same forward or backward. For example 12321, 100001 and 1 are palindrome numbers, while 112 and 1021 are not.

    Pari is trying to love them too, but only very special and gifted people can understand the beauty behind palindrome numbers. Pari loves integers with even length (i.e. the numbers with even number of digits), so she tries to see a lot of big palindrome numbers with even length (like a 2-digit 11 or 6-digit 122221), so maybe she could see something in them.

    Now Pari asks you to write a program that gets a huge integer n from the input and tells what is the n-th even-length positive palindrome number?

    Input

    The only line of the input contains a single integer n (1 ≤ n ≤ 10100 000).

    Output

    Print the n-th even-length palindrome number.

    Sample Input

    Input
    1
    Output
    11
    Input
    10
    Output
    1001

    水题!!

    正反各输出一次。

    附AC代码:

     1 #include<iostream>
     2 #include<cstring>
     3 #include<cstdio>
     4 using namespace std;
     5 
     6 int main(){
     7     string s;
     8     while(cin>>s){
     9         cout<<s;
    10         for(int i=s.size()-1;i>=0;i--){
    11             cout<<s[i];
    12         }
    13         cout<<endl;
    14     }
    15     return 0;
    16 }
  • 相关阅读:
    MongoDB_聚合
    MongoDB_基本操作
    MongoDB_"Error parsing YAML config file: yaml-cpp: error at line 3, column 9: illegal map value"解决方法
    MongoDB_安装
    beautifulsoup模块
    python发送邮件
    selenium常用操作
    selenium元素定位
    requests模块的高级用法
    继承
  • 原文地址:https://www.cnblogs.com/Kiven5197/p/5656010.html
Copyright © 2011-2022 走看看