Ugly Numbers UVA - 136

最新推荐文章于 2020-03-15 18:24:22 发布

林乃杰

最新推荐文章于 2020-03-15 18:24:22 发布

阅读量370

点赞数

分类专栏： ACM 文章标签： acm uva stl

本文链接：https://blog.csdn.net/linmushi/article/details/71566002

版权

ACM 专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence1, 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.InputThere is no input to this program.OutputOutput should consist of a single line as shown below, with ‘’ replaced by the numbercomputed.Sample OutputThe 1500'th ugly number is .

题意：定义丑数是不能被2,3,5意外的其他素数整除的数；求第1500个丑数

题解：建立优先队列，每出来一个丑数塞三个丑数回去

代码：

#pragma comment(linker, "/STACK:102400000,102400000") 
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
#include <queue>
#define Pi acos(-1.0)
using namespace std;
typedef long long ll;
int a[3] = {2,3,5};
map<ll,int>mp;
int main(){
	mp.clear();
	priority_queue<ll,vector<ll>, greater<ll> >que;
	que.push(1);
	mp[1] = 1;
	for(int i = 1;;i++){
		ll now = que.top();
		que.pop();
		if(i==1500){
			printf("The 1500'th ugly number is %lld.\n", now);
			break;
		}
		for(int j = 0;j < 3;j++){
			ll nnow = now * a[j];
			if(!mp[nnow]){
				mp[nnow] = 1;
				que.push(nnow);
			}
		}
		
	}
}