UVALive 2889 Palindrome Numbers
来源:互联网 发布:淘宝申请退货几天到账 编辑:程序博客网 时间:2024/05/17 08:21
Question:
A palindrome is a word, number, or phrase that reads the same forwards as backwards. For example,
the name “anna” is a palindrome. Numbers can also be palindromes (e.g. 151 or 753357). Additionally
numbers can of course be ordered in size. The first few palindrome numbers are: 1, 2, 3, 4, 5, 6, 7, 8,
9, 11, 22, 33, …
The number 10 is not a palindrome (even though you could write it as 010) but a zero as leading
digit is not allowed.
Input
The input consists of a series of lines with each line containing one integer value i (1 ≤ i ≤ 2 ∗ 109
).
This integer value i indicates the index of the palindrome number that is to be written to the output,
where index 1 stands for the first palindrome number (1), index 2 stands for the second palindrome
number (2) and so on. The input is terminated by a line containing ‘0’.
Output
For each line of input (except the last one) exactly one line of output containing a single (decimal)
integer value is to be produced. For each input value i the i-th palindrome number is to be written to
the output.
Sample Input
1
12
24
0
Sample Output
1
33
151
题意大意:将回文数从大到小排列,1,2,3,4,5,6,7,8,9,11,22,,,,99,,,输入一个数n,让你输出第n大的回文数是多少。
思路:仔细找你会发现一位数和两位数的回文数都只有9个,三位数和四位数的回文数有90个,五位数和六位数的回文数有900个,以此类推。
(http://acm.hust.edu.cn/vjudge/contest/121559#problem/H)
#include <iostream>#include <cstdio>using namespace std;int main(){ int n,i,j,t1,t2,t3; while (scanf("%d",&n),n) { i=9;j=1; while (1) { if(n<=i) { t1=j+n-1; //此部分数位奇数位,设位数为n,先算出前面部分n/2+1位 cout<<t1; t2=t1/10; while(t2) { cout<<t2%10; // 再算出后面的n/2位 t2/=10; } break; } n-=i; if(n<=i) { t1=j+n-1; //此部分数位偶数位,设位数为n,先算出前面部分n/2位 cout<<t1; t2=t1; while(t2) { cout<<t2%10; // 再算出后面的n/2位 t2/=10; } break; } n-=i; i*=10; j*=10; } cout<<endl; } return 0;}
体会:做题要善于总结规律,发现规律,千万不要嫌麻烦,多算几组可能就发现规律了。
- UVALive 2889 Palindrome Numbers
- Palindrome Numbers(UVALive 2889)
- Palindrome Numbers UVALive
- UVaLIve 2889 | LA 2889 | UVa 12050 - Palindrome Numbers (组合数学)
- Palindrome Numbers
- UVALive:6182 Ginkgo Numbers
- UVALive 6182 - Ginkgo Numbers
- UVALive 7279 Sheldon Numbers
- ZOJ 2000 Palindrome Numbers
- poj 2402 Palindrome Numbers
- Palindrome Numbers(P2402)
- No. 23 - Palindrome Numbers
- POJ 2402 Palindrome Numbers
- uva 12050 - Palindrome Numbers
- UVa:12050 Palindrome Numbers
- UVA - 12050 Palindrome Numbers
- zoj2000 Palindrome Numbers
- LeetCode-Palindrome Numbers
- drwxrwx--x代表什么
- JAVA的自我修养
- 用递归函数和栈操作逆序一个栈
- 接口和抽象类区别
- Timus 1104 Don’t Ask Woman about Her Age
- UVALive 2889 Palindrome Numbers
- GP学习(十)-Mosaic raster datasets to a file raster format
- HDU 4352 XHXJ's LIS
- C#和JAVA利用BASE64实现图片编码解码
- 容斥原理 —— 求1~n有多少个数与k互质(二进制算法详细解释&模板)
- CodeForces 1B
- Java wait(long arg)方法的使用
- golang substring方法的几种实现
- NYOJ263精挑细选