poj 2247 Humble Numbers
2011-11-22 08:46
197 查看
Humble Numbers
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
Sample Output
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 7754 | Accepted: 3666 |
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.
#include<iostream> using namespace std; int Min(int a ,int b) { return a<b?a:b; } int main() { int i,j,k,l; i=j=k=l=1; int data[5843]; memset(data,0,sizeof(data)); data[0]=1; for(int m=1;m<=5842;m++) { int num1=data[i-1]*2; int num2=data[j-1]*3; int num3=data[k-1]*5; int num4=data[l-1]*7; int min=Min(Min(num1,num2),Min(num3,num4)); data[m]=min; if(num1==min) i++; if(num2==min) j++; if(num3==min) k++; if(num4==min) l++; } int n; while(cin>>n,n) { if(n%10==1&&n%100!=11) cout<<"The "<<n<<"st humble number is "<<data[n-1]<<'.'<<endl; else if(n%10==2&&n%100!=12) cout<<"The "<<n<<"nd humble number is "<<data[n-1]<<'.'<<endl; else if(n%10==3&&n%100!=13) cout<<"The "<<n<<"rd humble number is "<<data[n-1]<<'.'<<endl; else cout<<"The "<<n<<"th humble number is "<<data[n-1]<<'.'<<endl; } return 0; }
相关文章推荐
- poj 2247 Humble Numbers
- poj 2247 Humble Numbers
- poj 2247 Humble Numbers
- POJ 2247 Humble Numbers
- POJ 2247 Humble Numbers
- poj 1338 ugly numbers和poj 2247Humble Numbers 解题报告(附详细分析)
- poj 2247 Humble Numbers
- POJ 2247 && HDU 1058 Humble Numbers(数论)
- POJ 2247 Humble Numbers
- POJ 2247 Humble Numble(我的水题之路——丑数2,3,5,7)
- hdu 1058 Humble Numbers || poj 1338(dp)
- UVa 443 / POJ 2247 Humble Numbers (4因子-丑数&STL灵活运用)
- PKU 2247 Humble Numbers
- 一类计算问题小结poj&hoj Set Definition ,Humble Numbers ,Ugly Numbers 因子构造法
- HUD 1058 Humble Numbers
- The number of divisors(约数) about Humble Numbers
- USACOTrainning.Section 3.1.Humble Numbers
- DP Problem D:Humble Numbers(HDU 1058)
- POJ 1995 Raising Modulo Numbers 笔记
- hdu 1058 Humble Numbers【丑数】