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

丑数是不能被2,3,5 以外的其他素数整除的数，让求出第1500个丑数，1为开始....

首先理解题意，因为不能被除了这三个之外的其他素数整除，也就是这三个数来回辗相乘得到的一系列数.....利用优先队列的自动排序性，结合循环条件的控制，自动计算到第1500个.........

感觉思路好巧妙，stl 的功能只有多用才能用的更灵活，现在才学了一点点.....继续努力！

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int coeff[3]={2,3,5};
int main()
{
	//freopen("shuju.txt","r",stdin);
	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)
		{
			printf("The 1500'th ugly number is %lld.\n",x);
			break;
		}
		for(int j=0;j<3;++j)//每次生成三个数
		{
			ll y=x*coeff[j];
			if(!s.count(y))//防止重复
			{
				s.insert(y);
				q.push(y); 
			}
		}
	}
	return 0;
}