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. <br><br>Write a program to find and print the nth element in this sequence<br>
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.<br>
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.<br>
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除外)因数只有2357构成求第i个该数思路:一开始想的太简单了首先是只要能整除2357即可但是题目并不是这样的,后来想了像这是个标准的dp每次存储的这个数是这上一个“存”数的
2 3 5 7 被的最小的一个,这个题还有个难点在于第几的英文缩写一开始我认为只要%10看余数是1即可st 2rd3 nd,可是后来发现这个11依然是th,所以只能用if重新判断
代码:
#include<iostream>
using namespace std;
int main()
{
int num[6000];
int i,j,k,l,q,n;
i=j=k=l=1;
num[1]=1;
for(q=2;q<=5845;q++)
{
num[q]=min(num[i]*2,min(num[j]*3,min(num[k]*5,num[l]*7)));
if(num[q]==num[i]*2)
i++;
if(num[q]==num[j]*3)
j++;
if(num[q]==num[k]*5)
k++;
if(num[q]==num[l]*7)
l++;
}
while (cin>>i&&i!=0)
{
if (i% 100 != 11 && i % 10 == 1){
cout<<"The "<<i<<"st humble number is "<<num[i]<<"."<<endl;
}
else if (i% 100 != 12 && i % 10 == 2){
cout<<"The "<<i<<"nd humble number is "<<num[i]<<"."<<endl;
}
else if (i % 100 != 13 && i % 10 == 3){
cout<<"The "<<i<<"rd humble number is "<<num[i]<<"."<<endl;
}
else{
cout<<"The "<<i<<"th humble number is "<<num[i]<<"."<<endl;
}
}
return 0;
}
using namespace std;
int main()
{
int num[6000];
int i,j,k,l,q,n;
i=j=k=l=1;
num[1]=1;
for(q=2;q<=5845;q++)
{
num[q]=min(num[i]*2,min(num[j]*3,min(num[k]*5,num[l]*7)));
if(num[q]==num[i]*2)
i++;
if(num[q]==num[j]*3)
j++;
if(num[q]==num[k]*5)
k++;
if(num[q]==num[l]*7)
l++;
}
while (cin>>i&&i!=0)
{
if (i% 100 != 11 && i % 10 == 1){
cout<<"The "<<i<<"st humble number is "<<num[i]<<"."<<endl;
}
else if (i% 100 != 12 && i % 10 == 2){
cout<<"The "<<i<<"nd humble number is "<<num[i]<<"."<<endl;
}
else if (i % 100 != 13 && i % 10 == 3){
cout<<"The "<<i<<"rd humble number is "<<num[i]<<"."<<endl;
}
else{
cout<<"The "<<i<<"th humble number is "<<num[i]<<"."<<endl;
}
}
return 0;
}