hdu 1058:Humble Numbers（动态规划 DP）-优快云博客

本文介绍了一种使用简单动态规划解决Humble Numbers问题的方法。通过维护一个数组来存储已知的Humble Numbers，并利用2、3、5、7这四个质数不断生成新的Humble Numbers。文章还详细介绍了如何正确地输出序数形式。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Humble Numbers

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

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

100

1000

5842

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 1024 1203

　　简单动态规划问题。

　　思路是后面的Humble数总可以用前面求得的某个Humble数乘以{2,3,5,7}中的一个求得。

　　需要注意的是输出需要按序数的规则输出，个位数是1、2、3的后缀分别是st、nd、rd，但是后两位为11、12、13的数例外（例如11、12、13、111、112、113），它们的后缀是th。其余数后缀均为th。

　　借鉴于前人的思路：http://minda-ly.diandian.com/post/2011-02-10/17312430

 1 #include <iostream>
 2 using namespace std;
 3 int a[6000];
 4 int Min(int a,int b,int c,int d)
 5 {
 6     int t;
 7     t = a<b?a:b;
 8     t = t<c?t:c;
 9     t = t<d?t:d;
10     return t;
11 }
12 int main()
13 {
14     int n;
15     a[1] = 1;
16     int a1=1,a2=1,a3=1,a4=1;
17     int e1,e2,e3,e4;
18     for(int i=2;i<6000;i++){
19         e1 = a[a1]*2;
20         e2 = a[a2]*3;
21         e3 = a[a3]*5;
22         e4 = a[a4]*7;
23         a[i] = Min(e1,e2,e3,e4);
24         if(a[i]==e1)
25             a1++;
26         if(a[i]==e2)
27             a2++;
28         if(a[i]==e3)
29             a3++;
30         if(a[i]==e4)
31             a4++;
32     }
33     while(cin>>n){
34         if(n==0)
35             break;
36         if(n%100==11 || n%100==12 || n%100==13)
37             cout<<"The "<<n<<"th humble number is "<<a[n]<<'.'<<endl;
38         else {
39             int t = n%10;
40             switch(t){
41                 case 0:cout<<"The "<<n<<"th humble number is "<<a[n]<<'.'<<endl;break;
42                 case 1:cout<<"The "<<n<<"st humble number is "<<a[n]<<'.'<<endl;break;
43                 case 2:cout<<"The "<<n<<"nd humble number is "<<a[n]<<'.'<<endl;break;
44                 case 3:cout<<"The "<<n<<"rd humble number is "<<a[n]<<'.'<<endl;break;
45                 default:cout<<"The "<<n<<"th humble number is "<<a[n]<<'.'<<endl;break;
46             }
47         }
48     }
49     return 0;
50 }