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.
数据很大,不能一个一个的推测是否为Humble Numbers,所以这里可以直接求每一个Humble Numbers。由题可知,Humble Numbers的特点是因子里只有2,3,5,7这四个数,所以可以直接用这四个数来求,比较难的是排序问题,所以这里用了min和a,b,c,d来表示2,3,5,7所乘的倍数,如果乘过某个数,则这个数+1,因为倍数也必须是Humble Numbers,所以这里乘的是已经得出的Humble Numbers,a,b,c,d表示下标。
#include<stdio.h>
#include<algorithm>
using namespace std;
long long k[10000];
int main()
{
k[1]=1;
int a=1,b=1,c=1,d=1;
int s=5;
for(int i=2; i<=5842; i++)
{
k[i]=min(min(min(k[a]*2,k[d]*7),k[b]*3),k[c]*5);
if(k[i]==k[a]*2)
a++;
else if(k[i]==k[b]*3)
b++;
else if(k[i]==k[c]*5)
c++;
else if(k[i]==k[d]*7)
d++;
if(k[i]==k[i-1])
i--;
}
int n;
while(~scanf("%d",&n)&&n)
{
if(n%10==1&&n%100!=11)
printf("The %dst humble number is %lld.\n",n,k[n]);
else if(n%10==2&&n%100!=12)
printf("The %dnd humble number is %lld.\n",n,k[n]);
else if(n%10==3&&n%100!=13)
printf("The %drd humble number is %lld.\n",n,k[n]);
else
printf("The %dth humble number is %lld.\n",n,k[n]);
}
}