TKO 6-1 DP入门之1058（寻找第n个因数只有2、3、5、7的数字）

杭电1058：
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

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.

题目的大体意思就是寻找含有的因子只含有为
2、3、5、7的数字，那么我们需要记录每一个生成之后的倍数。将这些数设置为下一次可能用到的因数，以此作为思路，不断循环往复，将算法构造完成。
那么接下来就是我的代码：

Problem : 1058 ( Humble Numbers )

Judge Status : Accepte