HDOJ1058 Humble Numbers DP简单题

最新推荐文章于 2021-07-14 11:03:22 发布

罗侯

最新推荐文章于 2021-07-14 11:03:22 发布

阅读量390

点赞数

分类专栏： DP 文章标签： dp acm

本文链接：https://blog.csdn.net/computer_user/article/details/77131207

版权

DP 专栏收录该内容

17 篇文章

订阅专栏

Humble Numbers

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

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

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: 1159 1069 1087 1257 1025

首先第一个humble numbers肯定是1嘛，因为这类数字的性质就是质因子只有2，3，5，7 所以每个humble number都能由之前的humble number 推导出来。所以初始值定义 p2=p3=p5=p7=1，之后如果找到一个humble number>=dp[p2]*2, p2++

p3 p5 p7 类似的，注意题目给出的输出（我就在这里翻车了很多次，mmp）