UVa 443 humble numbers:4 factor-ugliness number &stl flexible application

443-humble Numbers

Time limit:3.000 seconds

Http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem &problem=384

A number whose only prime factors are 2,3,5/7 is called a humble number. The sequence is 1, 2, 3, 4, 5, 6, 7, 8, 9, and, A,,, and, shows the numbers of the "humble".

Write a program to find and print the nth element in this sequence.

Input specification

The input consists of one or more test cases. Each test case consists of the one integer n with. The Input is terminated by a value of zero (0) for N.

Output specification

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 is used like I T is shown in the sample output.

Sample Input

1
2
3
4
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.
The 12th humble number is.
The 13th humble number is.
The 21st humble number is.
The 22nd humble number is.
The 23rd humble number is.
The 100th humble number is 450.
The 1000th humble number is 385875.
The 5842nd humble number is 2000000000.

Kill with set seconds.

See more highlights of this column: http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/