문제1155--Humble Numbers

1155: Humble Numbers

실행시간 제한: 1 Sec  메모리사용 제한: 128 MB
제출: 112  통과: 42
[제출] [채점기록] [묻고답하기]

문제 설명

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,$$\dots $ shows the first 20 humble numbers. 

 

Write a program to find and print the $n$th element in this sequence. 

 

입력 설명

The input consists of one or more test cases. Each test case consists of one integer $n$ with $1 \leq n \leq 5842$. Input is terminated by a value of zero (0) for $n$.
 

 

출력 설명

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.
 

 

입력 예시 Copy

1
2
3
4
11
12
13
21
22
23
100
1000
5842
0

출력 예시 Copy

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.

출처/분류