Humble number
来源:互联网 发布:java adt是什么 编辑:程序博客网 时间:2024/05/16 23:54
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
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.
Source
University of Ulm Local Contest 1996
#include<iostream>using namespace std;int min(int a,int b){if(a<b)return a;return b;}int mp[6001];int main(){//freopen("a.in","r",stdin);int i,n,a,b,c,d;for(i=1;i<8;i++)mp[i]=i; a=b=c=d=1;for(i=8;i<5900;i++){while(2*mp[a]<=mp[i-1])a++;while(3*mp[b]<=mp[i-1])b++;while(5*mp[c]<=mp[i-1])c++;while(7*mp[d]<=mp[i-1])d++;mp[i]=min(2*mp[a],min(3*mp[b],min(5*mp[c],7*mp[d])));}while(cin>>n){if(n==0)break;cout<<"The ";cout<<n;if(n%10==1&&n%100!=11)cout<<"st";else if(n%10==2&&n%100!=12)cout<<"nd";else if(n%10==3&&n%100!=13)cout<<"rd";elsecout<<"th";cout<<" humble number is "<<mp[n]<<"."<<endl;}return 0;}
- Humble Number
- humble number
- Humble number
- hdu1058 Humble Number
- humble number hdu 1058
- hdu 1058 humble number
- USACO Humble Number
- HDU 1058 Humble Number
- [toj1136]Humble Number
- [toj1136]Humble Number
- USACO Humble Number
- hdoj 1058 Humble Number
- hdu 1058 Humble Number
- hdu 1058 humble number
- 丑数humble number
- hdoj1058(humble number
- hdu 1058 humble number
- humble number的代码分析
- DFA 算法实现敏感词过滤(python 实现)
- STL算法简介
- opencv学习心得三----读取摄像头
- Android中联系人使用
- httpModules?与 httpHandler 的区别
- Humble number
- hibernate中存枚举类型的配置
- hdu 2089 不要62(数位dp)
- 更新整理本人所有博文中提供的代码与工具(Java,2013.08)
- 函数可重入和可重载
- Codeforces Yandex.Algorithm 2011 Qualification 2 / 82A Double Cola (数学规律&模拟)
- C++关闭所有窗口
- 小程序(十六)简单四则运算
- 《C++ Primer Plus》读书笔记----CHAP1