HDU1058

最新推荐文章于 2020-12-23 13:39:08 发布

lx0208

最新推荐文章于 2020-12-23 13:39:08 发布

阅读量234

点赞数

分类专栏： AC历程文章标签： humble hdu acm

本文链接：https://blog.csdn.net/lx0208/article/details/76028678

版权

AC历程专栏收录该内容

54 篇文章 0 订阅

订阅专栏

1058
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26556 Accepted Submission(s): 11700

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.

Source
University of Ulm Local Contest 1996

Recommend
JGShining | We have carefully selected several similar problems for you: 1003 1159 1069 1087 1176

题目旨在求出只含因子2，3，5，7的丑数，即n*(2,3,5,7)的数，本题关键在于按顺序的排列计算丑数，即需要依次取最小数，对应因子的次数+1，题目还有一个需要注意的地方是n%100为11，12，13的数的输出是“th“

#include <stdio.h>
int dp[4845] = { 1,1 };
int a, b, c, d;

int min(int u, int v, int x, int y)
{
    int temp = u;
    if (temp > v) temp = v;
    if (temp > x) temp = x;
    if (temp > y) temp = y;
    if (temp == u) ++a;
    if (temp == v) ++b;
    if (temp == x) ++c;
    if (temp == y) ++d;

    return temp;
}
int main()
{
    int i, n;
    a = b = c = d = 1;
    for (i = 2; i < 5843; ++i)
        dp[i] = min(dp[a] * 2, dp[b] * 3, dp[c] * 5, dp[d] * 7);
    while (scanf("%d", &n), n)
    {
        printf("The %d", n);
        if (n % 100 == 11 || n % 100 == 12 || n % 100 == 13)printf("th ");
        else if (n % 10 == 1)printf("st ");
        else if (n % 10 == 2)printf("nd ");
        else if (n % 10 == 3)printf("rd ");
        else printf("th ");
        printf("humble number is %lld.\n", dp[n]);
    }

    return 0;
}