Humble Numbers
来源:互联网 发布:国安大数据 编辑:程序博客网 时间:2024/05/24 05:02
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
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
1234111213212223100100058420
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.#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int mm(int a, int b, int c, int d){ int min1=a < b ? a : b; int min2 = c < d ? c : d; return min1 < min2 ? min1 : min2;}int main(){ int n, a[5850], b2=1, b3=1, b5=1, b7=1; a[1] = 1; int m = 1; while(m <= 5842) { int temp = mm(2*a[b2], 3*a[b3], 5*a[b5], 7*a[b7]); a[++m] = temp; if(temp == 2*a[b2]) b2++; if(temp == 3*a[b3]) b3++; if(temp == 5*a[b5]) b5++; if(temp == 7*a[b7]) b7++; } while(~scanf("%d",&n)&&n) { printf("The %d",n); if(n % 10 == 1 && n % 100 != 11) printf("st"); else if(n % 10 == 2 && n % 100 != 12) printf("nd"); else if(n % 10 == 3 && n % 100 != 13) printf("rd"); else printf("th"); printf(" humble number is %d.\n",a[n]); } return 0;}
0 0
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- 省去 ListView 滚动条 显示全部内容
- AWT的双缓冲技术
- 在一本书上摘录的Eclipse的中文配置教程>>希望能帮助到有需要的人
- 2014-12-01:NaN+跳出多重循环
- MATLAB数据处理快速学习教程
- Humble Numbers
- 2014-12-02:组合与继承
- Review of codeforces 492C Vanya and Computer Game based on Python
- ubuntu下的PyQt4开发环境配置
- 阅读 对数组排序处理
- 算法导论-第24章- 单源最短路径 - 24.1 Bellman-Ford 算法
- Packets
- oracle视频学习笔记(二)
- 程序员的十层楼