F - 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

code:

//丑数的定义是因子中的质数只能是2 3 5除，所以直接dp到第1500个就行了
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#define inf 0x3f3f3f3f
typedef long long ll;
using namespace std ;
#define max(a,b) ( ((a)>(b)) ? (a):(b) )
#define min(a,b) ( ((a)<(b)) ? (a):(b) )

int main()
{
    int dp[1550],n,i;
    dp[1]=1;
    i=2;
    int x=1,y=1,z=1;
    while(i<=1505)
    {
        dp[i]=min(min(2*dp[x],3*dp[y]),5*dp[z]);
        if(dp[i]==2*dp[x])x++;
        if(dp[i]==3*dp[y])y++;
        if(dp[i]==5*dp[z])z++;
        i++;
    }
    printf("The 1500'th ugly number is %d.\n",dp[1500]);
    return 0;
}