题意所有只能被2，3，5，7这4个素数整除的数称为Humble Number 输入n 输出第n个Humble Number

1是第一个humble number 对于一个Humble Number a 有2*a,3*a,5*a,7*a都是Humble Number 可以以1为基数依次展开即可得到一定范围内的Humble Number 用i,j,k,l分别记录 2，3，5，7分别乘到了第几个Humble Number 当前在计算第cnt个Humble Number 那么有 hum[cnt] = min ( hum[i] * 2, hum[j] * 3, hum[k] * 5, hum[l] * 7) 然后对应min的i或j或k或l就加1 当cnt到达了n 结果就出来了

#include<cstdio>
#include<algorithm>
using namespace std;
const int N = 5843;
int hum[N], cnt, n;
int main()
{int i = 1, j = 1, k = 1, l = hum[1] = 1;for (cnt = 2; cnt < N; ++cnt){hum[cnt] = min ( min(hum[i] * 2, hum[j] * 3), min (hum[k] * 5, hum[l] * 7));if (hum[cnt] == hum[i] * 2) ++i;if (hum[cnt] == hum[j] * 3) ++j;if (hum[cnt] == hum[k] * 5) ++k;if (hum[cnt] == hum[l] * 7) ++l;}while (scanf ("%d", &n), n){printf ("The %d", n);if (n % 100 != 11 && n % 10 == 1) printf ("st ");else if (n % 100 != 12 && n % 10 == 2) printf ("nd ");else if (n % 100 != 13 && n % 10 == 3) printf ("rd ");else printf ("th ");printf ("humble number is %d.\n", hum[n]);}return 0;
}

Humble Numbers

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.

转载于:https://www.cnblogs.com/acvay/p/3947286.html

HDU 1058 Humble Numbers（DP,数）相关推荐

（HDU）1058 --Humble Numbers( 丑数）
题目链接:http://vjudge.net/problem/HDU-1058 这题有点难度,自己写了半天依旧TLE,参考了其他人的博客. http://blog.csdn.net/pythonfx/ ...
hdu 1058 Humble Numbers
状态转移方程:F(n)=min(F(i)*2,F(j)*3,F(k)*5,F(m)*7) (n>i,j,k,m) 特别的:i,j,k,m 只有在本项被选中后才移动题目还要注意的一点是输出问题 ...
usaco ★Humble Numbers 丑数
★Humble Numbers 丑数对于一给定的素数集合 S = {p1, p2, ..., pK}, 来考虑那些质因数全部属于 S 的数的集合.这个集合包括,p1, p1p2, p1p1, 和 p ...
Humble Numbers(丑数) 超详解！
给定一个素数集合 S = { p[1],p[2],...,p[k] },大于 1 且素因子都属于 S 的数我们成为丑数(Humble Numbers or Ugly Numbers),记第 n 大的丑 ...
zoj1095 Humble Numbers(DP)
/* 简单DP:每次将求得的值分别乘以2,3,4,7,然后利用插入排序插入到数据序列中保证数据的递增序,最终到达结束状态. */ View Code 1 #include <iostr ...
【HDOJ】1058 Humble Numbers
简单题,注意打表,以及输出格式.这里使用了可变参数. 1 #include <stdio.h> 2 3 #define MAXNUM 5845 4 #define ANS 20000000 ...
HDU 1058(打表）
题目链接: http://acm.hdu.edu.cn/showproblem.php?pid=1058 Humble Numbers Time Limit: 2000/1000 MS (Java/O ...
Humble Numbers （谦卑数 || 丑数）
Humble Numbers 题目来源:https://vjudge.net/contest/278033#problem/B || http://acm.hdu.edu.cn/showproblem ...
BZOJ 1662: [Usaco2006 Nov]Round Numbers 圆环数（数位DP+恶心细节）
BZOJ 1662: [Usaco2006 Nov]Round Numbers 圆环数 Time Limit: 5 Sec Memory Limit: 64 MB Description 正如你所知 ...
HDU 1492 The number of divisors(约数) about Humble Numbers（数论，简单约数）
The number of divisors(约数) about Humble Numbers Time Limit: 2000/1000 MS (Java/Others) Memory Lim ...

HDU 1058 Humble Numbers（DP,数）

Humble Numbers

HDU 1058 Humble Numbers（DP,数）相关推荐

最新文章

热门文章