Humble Numbers-hdu1058

最新推荐文章于 2019-10-06 08:19:21 发布

原创最新推荐文章于 2019-10-06 08:19:21 发布 · 517 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#打表

数学计算专栏收录该内容

5 篇文章

订阅专栏

本文介绍了一种算法，用于找出一系列特殊数列中的第N个数，这些数被称为泡泡数，它们仅由质因数2、3、5或7组成。通过动态更新下标的方法，实现了高效求解。

以前做的打表问题，都是让计数变量在变得出结果，而这次的打表很巧妙地利用了计数变量作为数组下标来动态地取出数组中的值来运算。

H - Humble Numbers

Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu

Submit Status

Description

Many of you heard about ugly number. Now we are introducing a new number that is called bubble number.
A number whose only prime factors are 2,3,5 or 7 is called a bubble 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 bubble numbers.

Write a program to find and print the nth element in this sequence.

Input Specification

The input consists of one or more test cases. Each test case consists of one integer n with . Input is terminated by a value of zero (0) for n.

Output Specification

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. (here humble means bubble)

See http://en.wikipedia.org/wiki/English_numerals#Ordinal_numbers for more explanation of using correct suffix

Sample Input

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.

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
int f[6000];
int min(int a,int b)
{
    return a<b? a:b;
}
void prin()
{
    f[1]=1;
    int a=1,b=1,c=1,d=1;
    for(int i=2; i<6000; i++)
    {
        f[i]=min(f[a]*2,min(f[b]*3,min(f[c]*5,f[d]*7)));    //得出四个结果中最小的值
        if(f[i]==f[a]*2)                                    //判断哪个会得出该值
            a++;                                            // 改变下标位置
        if(f[i]==f[b]*3)
            b++;
        if(f[i]==f[c]*5)
            c++;
        if(f[i]==f[d]*7)
            d++;
    }
}
int main()
{
    prin();
    int n;
    while(scanf("%d",&n)!=EOF&&n)
    {
        if(n%10==1&&n%100!=11)
            printf("The %dst humble number is %d.\n",n,f[n]);
        else if(n%10==2&&n%100!=12)
            printf("The %dnd humble number is %d.\n",n,f[n]);
        else if(n%10==3&&n%100!=13)
            printf("The %drd humble number is %d.\n",n,f[n]);
        else
            printf("The %dth humble number is %d.\n",n,f[n]);
    }
}