HDU 1058：Humble Numbers （水）

Humble Numbers

Time limit:1000 ms Memory limit:32768 kB

---

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

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.

---

题意：

只能被2,3,5,7整除的数叫丑数，问第n大的丑数是多少

解题思路：

直接暴力，把丑数存到set里面，然后取前5842个就可以了

Code：

#include <iostream>#include <cstdio>#include <set>#include <cmath>using namespace std;const int maxn=5842+5;typedef long long LL;set<LL> s;LL ans[maxn];void init(){    int t=30;    for(int i=0; i<=t; i++)    {        for(int j=0; j<=t; j++)        {            for(int k=0; k<=t; k++)            {                for(int l=0; l<=t; l++)                {                    LL temp=pow(2,i)*pow(3,j)*pow(5,k)*pow(7,l);                    s.insert(temp);                }            }        }    }    //cout<<s.size();    set<LL>::iterator it;    int len=0;    for(it=s.begin(); it!=s.end(); it++)    {        ans[len++]=*it;        if(len>5842)            break;    }}int main(){    int n;    init();    while(scanf("%d",&n)!=EOF)    {        if(n==0)            break;        printf("The %d",n);        if(n%10==1&&n%100/10!=1)            printf("st ");        else if(n%10==2&&n%100/10!=1)            printf("nd ");        else if(n%10==3&&n%100/10!=1)            printf("rd ");        else            printf("th ");        printf("humble number is %d.\n",ans[n]);    }    return 0;}