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 .
题意
丑数是指不能被2，3，5以外的其他素数整除的数。把丑数从小到大排列起来，结果如下：
1,2,3,4,5,6,8,9,10,12,15……
求第1500个丑数

一个丑数乘以丑数还是丑数，那么每一次取最小的丑数，然后乘2，乘3，乘5加入到set中，就是其他的丑数，每一次再去掉这个最小的丑数，找到第1500次，就是第1500个丑数；
可以用优先队列或者set来做。

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
	set<ll>s;
	s.insert(1);
	ll x, x1, x2, x3;
	for (int i = 1;; i++){
		x = *(s.begin());       //取当前容器中最小的丑数；
		s.erase(x);          //删除这个数；
		if (i != 1500){
			x1 = x * 2;
			x2 = x * 3;
			x3 = x * 5;
			s.insert(x1);           //插入新的三个丑数
			s.insert(x2);
			s.insert(x3);
		}
		else {
			cout << "The 1500'th ugly number is " << x << "." << endl;       //第1500次即是所求
			break;
		}
	}
	return 0;
}