zoukankan      html  css  js  c++  java
  • Codeforces-688B Lovely Palindromes

    Pari has a friend who loves palindrome numbers. A palindrome number is a number that reads the same forward or backward. For example 12321100001 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.

    Examples
    input
    1
    
    output
    11
    
    input
    10
    
    output
    1001
    
    Note

    The first 10 even-length palindrome numbers are 11, 22, 33, ... , 88, 99 and 1001.


    题目大意:

    求第n个偶数长度的回文串

    解法:

    第n个偶数长度的回文串就是正着输出一遍n,倒着输出一遍n既是。以下是代码

    #include <cstdio>
    #include <cstring>
    using namespace std;
    const int maxn = 1e5 + 5;
    int main()
    {
    	char str[maxn] = {0};
    	scanf("%s", str);
    	int len = strlen(str);
    	for(int i = 0; i < len; ++i) {
    		printf("%c", str[i]);
    	}
    	for(int i = len - 1; i >= 0; --i) {
    		printf("%c", str[i]);
    	}
    	return 0;
    }


  • 相关阅读:
    总结PLSQL的快捷键以及使用技巧
    WebStorm 常用快捷键
    bootStrap小结3
    bootStrap小结2
    bootStrap小结1
    DataTable操作
    2017春 前端自动化(一)构建工具的搭建
    前端自动化之(一)—浏览器自动实时刷新
    基于div表单模拟右对齐
    纯css去实现loading动画效果图
  • 原文地址:https://www.cnblogs.com/wiklvrain/p/8179472.html
Copyright © 2011-2022 走看看