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, 15, ...

shows the first 11 ugly numbers. By convention, 1 is included.

Write a program to find and print the 1500'th ugly number.

Input and Output

There is no input to this program. Output should consist of a single line as shown below, with <number> replaced by the number computed.

Sample output

The 1500'th ugly number is <number>.

#include<iostream>
#include<stdlib.h>
 using namespace std;
 int main()
 {
     int m2=0;
     int m3=0;
     int m5=0;
     long long a[1500];
     a[0]=1;
     long long tmp;
     for(int i=1;i<1500;i++)
     {
         //分别给上一次比较得到的数乘相应的倍数再比较
         tmp=2*a[m2]>3*a[m3]?3*a[m3]:2*a[m2];
         tmp=tmp>5*a[m5]?5*a[m5]:tmp;
         a[i]=tmp;//比较得到的较小数存入数组
         //满足条件的m加1，指向新得到的小数
         if(tmp==2*a[m2]) m2++;
         if(tmp==3*a[m3]) m3++;
         if(tmp==5*a[m5]) m5++;
     }
     for(int i=0;i<1500;i++)
     cout<<a[i]<<" ";
     system("pause");
     return 0;
 }