UVA-136 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
There is no input to this program.

Output
Output should consist of a single line as shown below, with ‘<>’ replaced by the number computed.

Sample Output
The 1500’th ugly number is <>.

分析：从小到大生成各个丑数，最小的丑数为1，对于任何丑数x，2x，3x，5x都是丑数。用一个优先队列保存已有的丑数，每次取出最小的，生成3个新丑数。注意判断是否重复。

Source：

#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;

typedef long long LL;
const int coeff[3]={2,3,5};

int main()
{
    priority_queue<LL,vector<LL>,greater<LL> > pq;
    set<LL> s;
    pq.push(1);
    s.insert(1);
    for(int i=1;;i++)
    {
        LL x=pq.top();
        pq.pop();
        if(i==1500)
        {
            cout<<"The 1500'th ugly number is "<<x<<".\n";
            break;
        }
        for(int j=0;j<3;j++)
        {
            LL x2=x*coeff[j];
            if(!s.count(x2))
            {
                s.insert(x2);
                pq.push(x2);
            }
        }
    }
    return 0;
}