HDUOJ------1058 Humble Numbers

Humble Numbers

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

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.

思路,对于任意一个数n,都可以由 n=∏q^r即由素数之积构成....

代码:

 1 #include<stdio.h>
 2 #include<string.h>
 3 #include<stdlib.h>
 4 /*策略打表实现存储*/
 5 __int64 sav[10000];
 6 int cmp(void const *a,void const *b)
 7 {
 8     return (*(__int64 *)a)-(*(__int64 *)b);
 9 }
10 int  work()
11 {
12     __int64 a,b,c,d,aa,bb,cc,dd;
13     int cnt=0;
14     for(a=0,aa=1; ;a++)
15     { 
16         if(a!=0) aa*=7;
17         if(aa>2000000000) break;
18         for(b=0,bb=1; ; b++)
19         {
20             if(b!=0) bb*=5;
21             if((aa*bb)>2000000000) break;
22             for(c=0,cc=1;  ; c++)
23             {
24                 if(c!=0)cc*=3;
25                 if((aa*bb*cc)>2000000000) break;
26                 for(d=0,dd=1; ;d++)
27                 {
28                     if(d!=0) dd*=2;
29                     if((aa*bb*cc*dd)>2000000000) break;
30                     sav[cnt++]=(aa*bb*cc*dd);
31                 }
32             }
33         }
34     }
35 
36     return cnt;
37 }
38 int main()
39 {
40     int n;
41     qsort(sav,work(),sizeof(sav[0]),cmp);
42     while(scanf("%d",&n),n)
43     {
44         int tem=n%100;
45         printf("The ");
46         if(tem>10&&tem<20)
47             printf("%dth ",n);
48         else
49         {
50             tem%=10;
51         if(tem==1)
52         printf("%dst ",n);
53         else if(tem==2)
54         printf("%dnd ",n);
55         else if(tem==3)
56             printf("%drd ",n);
57         else 
58             printf("%dth ",n);
59         }
60         printf("humble number is %I64d.\n",sav[n-1]);
61     }
62     return 0;
63 }

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

发表于

我来说两句

0 条评论
登录 后参与评论

相关文章

来自专栏ml

hdu----(5050)Divided Land(二进制求最大公约数)

Divided Land Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536...

37860
来自专栏ml

HDUOJ------2398Savings Account

Savings Account Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32...

32470
来自专栏小樱的经验随笔

POJ 1163 The Triangle【dp+杨辉三角加强版(递归)】

The Triangle Time Limit: 1000MS Memory Limit: 10000K Total Submissions: ...

29270
来自专栏ml

hdu------(1757)A Simple Math Problem(简单矩阵快速幂)

A Simple Math Problem Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32...

37770
来自专栏ml

hdu----(1677)Nested Dolls(DP/LIS(二维))

Nested Dolls Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768...

33160
来自专栏算法修养

ZOJ 3332 Strange Country II

Strange Country II ---- Time Limit: 1 Second      Memory Limit: 32768 KB      Sp...

36950
来自专栏ml

HDU-------(2795)Billboard(线段树区间更新)

Billboard Time Limit: 20000/8000 MS (Java/Others)    Memory Limit: 32768/32768 K...

356100
来自专栏ml

poj----(1251)Jungle Roads(最小生成树)

Jungle Roads Time Limit: 1000MS Memory Limit: 10000K Total Submissions: ...

33250
来自专栏ml

HDUOJ-----Computer Transformation

Computer Transformation Time Limit: 2000/1000 MS (Java/Others)    Memory Limi...

391110
来自专栏wym

Starship Troopers(树状dp) hdu1011

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Ot...

15210

扫码关注云+社区

领取腾讯云代金券