UVa - 136 - Ugly Numbers(STL - 优先队列priority_queue)

Description

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

#include<cstdio>
#include<set>
#include<queue>
using namespace std;
typedef long long LL;
int main(){
	
	set<int> s;
	priority_queue<LL ,vector<LL>,greater<LL> > pq;
	pq.push(1);
	LL k=1;
	int num[3]={2,3,5};
	for(int i=1 ; ;i++){
		k=pq.top();
		pq.pop();
		if(i==1500){
			printf("The 1500'th ugly number is %lld.\n",k);
			break;//找到后要跳出，不然会TLE 
		}
		
		for(int i=0 ;i<3 ;i++){
			LL x = num[i]*k;
			if(!s.count(x)){
				s.insert(x);
				pq.push(x);
			}
			
		}
	}

	
	return 0;
}