HDOJ_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.
思路:暴力肯定不行,根据筛子法套路来,根据第1个humblenumber生成第2个humblenumber,以此类推
#include <iostream>
using namespace std;
int main()
{
unsigned long long humbleNums[5842] = { 0 };
humbleNums[0] = 1;
int prime[4] = { 2, 3, 5, 7 };
for (unsigned long long i = 1; i < 5842; ++i)
{
humbleNums[i] = 20000000001;
for (int j = 0; j < 4; ++j)
{
for (int k = i - 1; k >= 0;k--)
{
if (humbleNums[k]*prime[j]<=humbleNums[i-1])
{
break;
}
if (humbleNums[k]*prime[j]<humbleNums[i])
{
humbleNums[i] = humbleNums[k] * prime[j];
}
}
}
}
int n;
while (cin >> n)
{
if (n == 0)
{
break;
}
cout << "The " << n;
if (n % 10 == 1 && n % 100 != 11)cout << "st ";
else if (n % 10 == 2 && n % 100 != 12)cout << "nd ";
else if (n % 10 == 3 && n % 100 != 13)cout << "rd ";
else cout << "th ";
cout << "humble number is " << humbleNums[n-1] << "." << endl;
}
return 0;
}
本文介绍了一个关于Humble Numbers的问题,Humble Numbers是指仅包含2、3、5、7作为质因数的整数。文章提供了一种有效的算法实现方案,通过预计算的方式找出序列中的特定元素,并展示了完整的C++代码实现及样例输入输出。
3254

被折叠的 条评论
为什么被折叠?



