UVA 136 Ugly Numbers（队列）

x是丑数，2x 3x 5x也是丑数，差点就用筛法做了

#include<iostream>
#include<cstdio>
#include<set>
#include<string>
#include<string.h>
#include<cstring>
#include<vector>
#include<map>
#include<queue>
#include<stack>
#include<cctype>
#include<algorithm>
#include<sstream>
#include<utility>
#include<cmath>
#include<functional>
#define mt(a) memset(a,0,sizeof (a))
#define fl(a,b,c) fill(a,b,c)
#define SWAP(a,b,t) (t=a,a=b,b=t)

#define inf 1000000000+7

using namespace std;
typedef long long ll;


priority_queue<ll,vector<ll>,greater<ll> >pq;
set<ll>s;

int main()
{
	s.insert(1);
	pq.push(1);
	for (int i = 1; i <=1600; i++)
	{
		ll t = pq.top(); pq.pop();
		if (i == 1500){
			printf("The 1500'th ugly number is %lld.\n", t); break;
		}
		if (!s.count(2 * t)){ pq.push(2 * t); s.insert(2 * t); }
		if (!s.count(3 * t)){ pq.push(3 * t); s.insert(3 * t); }
		if (!s.count(5 * t)){ pq.push(5 * t); s.insert(5 * t); }
	}
	system("pause");
	return 0;
}