Lovely Palindromes
来源:互联网 发布:02年韩国黑哨 知乎 编辑:程序博客网 时间:2024/06/10 21:27
Description
Pari has a friend who loves palindrome numbers. A palindrome number is a number that reads the same forward or backward. For example12321, 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
1
11
10
1001
Hint
The first 10 even-length palindrome numbers are 11, 22, 33, ... , 88, 99 and 1001.
这是一个思维规律题,只要把字符串反着输出就行了。还可以用strrev函数(反转字符)
1;
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define f(x) (x*x+x+41)#define size 1000011using namespace std;char str[size];int main(){int l;while(~scanf("%s",str)){printf("%s",str);l=strlen(str);for(int i=l-1;i>=0;i--)printf("%c",str[i]);printf("\n");}return 0;}
2;
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#define size 1000011using namespace std;char str[size];int main(){int l;while(~scanf("%s",str)){printf("%s",str);strrev(str);printf("%s\n",str);}return 0;}
- Lovely Palindromes
- 688B: Lovely Palindromes
- B. Lovely Palindromes
- Codeforces-688B Lovely Palindromes
- CodeForces 688B Lovely Palindromes
- CodeForces 688B - Lovely Palindromes
- codeforces 688B Lovely Palindromes
- Codeforces Round #360 (Div. 2) B. Lovely Palindromes
- Codeforces Round #360 (Div. 2) B Lovely Palindromes(水题)
- Codeforces Round #360 (Div. 2) B. Lovely Palindromes
- Codeforces Round #360 (Div. 2)-B. Lovely Palindromes
- Codeforces Round #360 (Div. 2) B. Lovely Palindromes
- CodeForces 688B Lovely Palindromes(偶数位回文数)
- Codeforces Round #360 (Div. 2) B Lovely Palindromes
- lovely
- Lovely Hometown
- Lovely Music
- Palindromes
- 平衡二叉树
- Java NIO系列教程(九) ServerSocketChannel
- ubuntu下搭建android开发环境
- hdu5695 Gym Class(拓扑排序+优先)
- IOS开发,常用快捷键汇总
- Lovely Palindromes
- [BZOJ 1028] [纪中3066] 麻将 水暴力
- 使用RemoteViews自定义通知栏样式
- 设计模式-命令模式
- C# 数组Copy的效率问题
- 分析一个java快速开发的工具
- SYSLOG 的学习和使用
- 在解析Json格式字符串时遇到的问题
- Swift-基础