Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 26743 Accepted Submission(s): 11773
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.
Source
Recommend
这一道题目用了打表的方法,空间复杂度要求很低 唯一要注意的是:输出有点小坑,注意英语单词第一至二十的后缀,刚一开始只是对10求余,判断后缀,后来发现,原来英语单词十一至二十的后缀都是th,呜呼,要细心呐 AC代码如下:
#include<stdio.h>
#include<string.h>
int min(int a,int b){
return a>b?b:a;
}
int main(){
int count[5850];
int p1,p2,p3,p4;
memset(count,0,sizeof(count));
count[1]=1;
p1=p2=p3=p4=1;
int x1=2,x2=3,x3=5,x4=7;
for(int i=1;i<=5842;){
count[++i]=min(min(x1*count[p1],x2*count[p2]),min(x3*count[p3],x4*count[p4]));
if(count[i]==x1*count[p1]){
p1++;
}
if(count[i]==x2*count[p2]){
p2++;
}
if(count[i]==x3*count[p3]){
p3++;
}
if(count[i]==x4*count[p4]){
p4++;
}
}
int n;
while(scanf("%d",&n)!=EOF&&n!=0){
int index=n%10;
int temp=n%100;
if(index==1&&(temp<10||temp>19))
printf("The %dst ",n);
else if(index==2&&(temp<10||temp>19))
printf("The %dnd ",n);
else if(index==3&&(temp<10||temp>19))
printf("The %drd ",n);
else
printf("The %dth ",n);
printf("humble number is %d.\n",count[n]);
}
return 0;
}