hdoj 1058 Humble Numbers (*)

Humble Numbers

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

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.
  
  

 

最后数据那么大：2e9，知道一定不能直接写，那么哪里可以用技巧呢，

丑数一定是前面的丑数乘 2 3 5 或7，那么寻找5842个丑数就好了

代码：

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
long long f[6000];
int main()
{
    int n;
    int prime[4]={2,3,5,7};
    f[1]=1;
    for(int i=2;i<=5842;i++)
    {
        f[i]=2000000001;
        for(int j=0;j<4;j++)
        {
            for(int k=i-1;k>0;k--)
            {
                if(f[k]*prime[j]<=f[i-1])
                    break;
                if(f[k]*prime[j]<f[i])//每次寻找最小的丑数
                    f[i]=f[k]*prime[j];
            }
        }
    }
    while(scanf("%d",&n),n)
    {
        if(n%10==1&&n%100!=11)
            printf("The %dst humble number is %lld.\n",n,f[n]);
        else if(n%10==2&&n%100!=12)
            printf("The %dnd humble number is %lld.\n",n,f[n]);
        else if(n%10==3&&n%100!=13)
            printf("The %drd humble number is %lld.\n",n,f[n]);
        else
            printf("The %dth humble number is %lld.\n",n,f[n]);
    }
    return 0;
}