UVa 136 - Ugly Numbers

求解丑数

#include <set>
#include <queue>
#include <vector>
#include <stdio.h>
#include <iostream>
#include <string.h>
#include <algorithm>

using namespace std;

typedef long long ll;

const int coeff[3] = {2,3,5};
int main(){
    priority_queue <ll, vector<ll>, greater<ll> > q;
    set <ll> s;
    q.push(1);
    s.insert(1);
    for(int i=1; ; i++){
        ll x = q.top(); q.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); q.push(x2);}
        }
    }
    return 0;
}