Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u
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.
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.
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
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.
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.
#include<cstdio>
#include<string.h>
using namespace std;
const int MAXN=;
int num2=,num3=,num5=,num7=;
long long s[MAXN];
void Sort()//sort函数是用来求humble number数组的
{
s[]=;
s[num2]=,s[num3]=,s[num5]=;
long long min=s[num2]*;
int num2=,num3=,num5=,num7=;
for(int i=;i<;i++)
{ min=s[num2]*;
if(min>s[num3]*)
min=s[num3]*;
if(min>s[num5]*)
min=s[num5]*;
if(min>s[num7]*)
min=s[num7]*;
s[i]=min;
// printf("%d ",s[i]);
//printf("%d ",min);
if(min==s[num2]*)
num2++;
if(min==s[num3]*)
num3++;
if(min==s[num5]*)
num5++;
if(min==s[num7]*)
num7++;
}
}
int main()
{
int n;
Sort();
while(scanf("%d",&n)!=EOF&&n)
{
if(n%==&&n%!=&&n!=)//当时卡在n%100!=11和12,13这里了，wa了几次！
printf("The %dst humble number is ",n);
else if(n%==&&n%!=&&n!=)
printf("The %dnd humble number is ",n);
else if(n%==&&n%!=&&n!=)
printf("The %drd humble number is ",n);
else printf("The %dth humble number is ",n);
printf("%lld.\n",s[n-]);
}
return ;
}