1338：Ugly Numbers

题目描述

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.

输入解释

Each line of the input contains a postisive integer n (n <= 1500).Input is terminated by a line with n=0.

输出解释

For each line, output the n’th ugly number .:Don’t deal with the line with n=0.

输入样例

输出样例

1
2
10

该题目是Virtual Judge题目，来自北京大学POJ

题目来源 New Zealand 1990 Division I,UVA 136

源链接： POJ-1338

最后修改于 2020-10-29T06:01:18+00:00 由爬虫自动更新

共提交 0 次

通过率 --%

时间上限	内存上限
1000	10000