HDU 1058:Humble Numbers
2016-03-01 18:50
513 查看
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21950 Accepted Submission(s): 9598
Problem Description
A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers.
Write a program to find and print the nth element in this sequence
Input
The input consists of one or more test cases. Each test case consists of one integer n with 1 <= n <= 5842. Input is terminated by a value of zero (0) for n.
Output
For each test case, print one line saying "The nth humble number is number.". Depending on the value of n, the correct suffix "st", "nd", "rd", or "th" for the ordinal number nth has to be used like it is shown in the sample output.
Sample Input
1
2
3
4
11
12
13
21
22
23
100
1000
5842
0
Sample Output
The 1st humble number is 1.
The 2nd humble number is 2.
The 3rd humble number is 3.
The 4th humble number is 4.
The 11th humble number is 12.
The 12th humble number is 14.
The 13th humble number is 15.
The 21st humble number is 28.
The 22nd humble number is 30.
The 23rd humble number is 32.
The 100th humble number is 450.
The 1000th humble number is 385875.
The 5842nd humble number is 2000000000.
Source
University of Ulm Local Contest 1996
Recommend
JGShining | We have carefully selected several similar problems for you: 1069 1087 1176 2084 1024
迷失在幽谷中的鸟儿,独自飞翔在这偌大的天地间,却不知自己该飞往何方……
#include<stdio.h> #define min(a,b) (a<b?a:b) #define min4(a,b,c,d) min(min(a,b),min(c,d)) int a[5850]; int main() { int n=1; int p2,p3,p5,p7; p2=p3=p5=p7=1; a[1]=1; while(a <2000000000) { a[++n] = min4(2*a[p2],3*a[p3],5*a[p5],7*a[p7]); if(a ==2*a[p2]) p2++; if(a ==3*a[p3]) p3++; if(a ==5*a[p5]) p5++; if(a ==7*a[p7]) p7++; } while(scanf("%d",&n) && n) { if(n%10 == 1&&n%100!=11) printf("The %dst humble number is ",n); else if(n%10 == 2&&n%100!=12) printf("The %dnd humble number is ",n); else if(n%10 == 3&&n%100!=13) printf("The %drd humble number is ",n); else printf("The %dth humble number is ",n); printf("%d.\n",a ); } return 0; }
相关文章推荐
- linux下编译代码遇到“/usr/bin/ld: cannot find -lcrypto”的问题
- Android 异步加载图片
- sublime部分调试信息的屏蔽
- cesium使用NODEJS搭建环境
- Qt之QHostInfo
- title与alt与区别
- HDU 1421:搬寝室
- 爱加密 使用
- Qt之QHostInfo
- BZOJ3994: [SDOI2015]约数个数和
- The content of element type "web-app" must match……问题之解决办法
- TortoiseGit配合msysGit在Git@OSC代码托管的傻瓜教程
- 你不得不读的书籍清单
- angular js的data赋值(给类中的一个类属性的属性赋值)
- Wireshark 文件分割和合并
- C++ virtual function (not pure virtual function)
- 历史研究
- ViewPager 小结
- 关于要研究的知识点
- Java中的日期操作类