POJ - 1338
Description
Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence
1, 2, 3, 4, 5, 6, 8, 9, 10, 12, ... shows the first 10 ugly numbers. By convention, 1 is included. Given the integer n,write a program to find and print the n'th ugly number. Input
Each line of the input contains a postisive integer n (n <= 1500).Input is terminated by a line with n=0.
Output
For each line, output the n’th ugly number .:Don’t deal with the line with n=0.
Sample Input 1 2 9 0 Sample Output 1 2 10 map拥有自动排序的强大功能
|
POJ - 1338 Ugly Numbers-STL的灵活运用
最新推荐文章于 2018-09-26 00:28:50 发布