Humble Numbers (HDU 1058)

Humble Numbers

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


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.
 
题意:让你求以2,、3、5、7为素数因子的数;

本来是打算用dp的,可不会写,于是只好暴力。
#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
const int maxn = 2000000000;
int main()
{
    __int64 i, j, k, r, g = 1, a[6000];

    for(i=0; i<31 && pow(2,i)<=maxn; i++)
        for(j=0; j<20 && pow(2,i)*pow(3,j)<=maxn; j++)
            for(k=0; k<14 && pow(2,i)*pow(3,j)*pow(5,k)<=maxn; k++)
                for(r=0; r<12 && pow(2,i)*pow(3,j)*pow(5,k)*pow(7,r)<=maxn; r++)
                    a[g++] = pow(2,i)*pow(3,j)*pow(5,k)*pow(7,r);
    sort(a+1,a+g+1);
    int t;
    while(~scanf("%d", &t), t)
    {
         printf("The %d", t);
         if(t%10 == 1 && t%100 != 11) printf("st ");
         else if(t%10 == 2 && t%100 != 12) printf("nd ");
         else if(t%10 == 3 && t%100 != 13) printf("rd ");
         else printf("th ");
         printf("humble number is %d.\n", a[t]);
    }
    return 0;
}


你可能感兴趣的:(ACMICPC)