HDU1058 DP

Humble Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24194    Accepted Submission(s): 10596


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
题意：
求第n个质因子只有2,3,5,7的数。
代码：
 1 //从1开始每个humble数依次乘以2，3,5,7，从小到大排列出来，可以简化为f[i]=min(2*f[a],3*f[b],5*f[c],7*f[d]),当然用麻烦的方法也能做。
 2 //注意1,2,3，21,22,23,111,112,113英文单词后缀st,nd,rd;11,12,13,10011,10012,10013,这样的和其他的后缀为th.
 3 #include<iostream>
 4 #include<cstdio>
 5 using namespace std;
 6 int n,a,b,c,d;
 7 long long f[5850];
 8 long min(long A,long B,long C,long D)
 9 {
10     long MIN=A;
11     if(B<MIN) MIN=B;
12     if(C<MIN) MIN=C;
13     if(D<MIN) MIN=D;
14     if(MIN==A) a++;
15     if(MIN==B) b++;
16     if(MIN==C) c++;
17     if(MIN==D) d++;
18     return MIN;
19 }
20 int main()
21 {
22     a=b=c=d=1;
23     f[1]=1;
24     for(int i=2;i<=5842;i++)
25     f[i]=min(2*f[a],3*f[b],5*f[c],7*f[d]);
26     while(scanf("%d",&n)&&n)
27     {
28         if(n%10==1&&n%100!=11)
29         printf("The %dst humble number is %lld.\n",n,f[n]);
30         else if(n%10==2&&n%100!=12)
31         printf("The %dnd humble number is %lld.\n",n,f[n]);
32         else if(n%10==3&&n%100!=13)
33         printf("The %drd humble number is %lld.\n",n,f[n]);
34         else printf("The %dth humble number is %lld.\n",n,f[n]);
35     }
36     return 0;
37 }

 

posted @ 2016-10-20 17:05  luckilzy  阅读(259)  评论(0)  编辑  收藏  举报