poj1338——Ugly Numbers

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

丑数是因子只包含2，3，5的数，但如果只单纯地将2X2或2X3，结果容易变大而错过前面的一些丑数，所以丑数首先得是最小的那个，得到丑数后将得到它的那个因子数加1，总之看代码就会理解。

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
    int n,i,ugly[1510],two=1,three=1,five=1,v2,v3,v5;
    ugly[1]=1;
    for(i=2;i<=1500;++i)
    {
        v2=ugly[two]*2;
        v3=ugly[three]*3;
        v5=ugly[five]*5;
        ugly[i]=min(min(v2,v3),v5);
        if(ugly[i]==v2)
            two++;
        if(ugly[i]==v3)
            three++;
        if(ugly[i]==v5)
            five++;
    }
    while(scanf("%d",&n)&&n)
    {
        printf("%d\n",ugly[n]);
    }
    return 0;
}