Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 17743 Accepted Submission(s): 7717
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
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.
题意:应该能看懂。
做法:注意输出格式就好。
#include <iostream>
#include <cstdio>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <algorithm>
#include<ctime>
#define esp 1e-6
#define LL long long
#define inf 0x0f0f0f0f
using namespace std;
__int64 ans[6000];
__int64 Min(__int64 a,__int64 b,__int64 c,__int64 d)
{
__int64 ans;
ans=min(a,b);
ans=min(ans,c);
ans=min(ans,d);
return ans;
}
void solve()
{
int i;
__int64 cnt1,cnt2,cnt3,cnt4;
cnt1=cnt2=cnt3=cnt4=1;
for(i=2;i<=5842;i++)
{
ans[i]=Min(ans[cnt1]*2,ans[cnt2]*3,ans[cnt3]*5,ans[cnt4]*7);
if(ans[i]==ans[cnt1]*2) cnt1++;
if(ans[i]==ans[cnt2]*3) cnt2++;
if(ans[i]==ans[cnt3]*5) cnt3++;
if(ans[i]==ans[cnt4]*7) cnt4++;
}
}
int main()
{
int n;
int t1,t2;
ans[1]=1;
solve();
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
t1=n%10;
t2=n/10%10;
if(t1==1&&t2!=1)
{
printf("The %dst humble number is %I64d.\n",n,ans[n]);
}
else if(t1==2&&t2!=1)
{
printf("The %dnd humble number is %I64d.\n",n,ans[n]);
}
else if(t1==3&&t2!=1)
{
printf("The %drd humble number is %I64d.\n",n,ans[n]);
}
else
printf("The %dth humble number is %I64d.\n",n,ans[n]);
}
}