[杂题] pku 1338 ugly numbers (STL解)

 

Ugly Numbers

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, ...
shows the first 10 ugly numbers. By convention, 1 is included.
Given the integer n,write a program to find and print the n'th ugly number.

 

Input

Each line of the input contains a postisive integer n (n <= 1500).Input is terminated by a line with n=0.

 

Output

For each line, output the n’th ugly number .:Don’t deal with the line with n=0.

 

Sample Input

1
2
9
0

 

Sample Output

1
2
10

算法分析：利用一个优先队列维护已经满足条件的ugly numbers，然后依次按照dp的思想进行插入变化

code：

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
typedef pair<unsigned long,int> node;

int main()
{
	int i,n;
	vector<unsigned long> ans;
	priority_queue< node , vector<node> , greater<node> > que;
	
    que.push(make_pair(1,2));

	for(i=0;i<1500;i++)
	{
    node temp=que.top();
	que.pop();
	//注意这里每个case后面没有break，这样处理可以避免重复的插入
	switch (temp.second)
	{
	case 2:que.push(make_pair(temp.first*2,2));
	case 3:que.push(make_pair(temp.first*3,3));
	case 5:que.push(make_pair(temp.first*5,5));
	}
	ans.push_back(temp.first);
	}
	while(cin>>n&&n)
	cout<<ans[n-1]<<endl;
}