这个主要是一些奇奇怪怪的用法,然后就是这么回事,丑数*2,3,5还是丑数,然后就是这么回事,每次取最小的丑数,*2,3,5还有就是需要用set记录一下是否出现过
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
int coef[3] = {2 , 3 , 5};
int main()
{
priority_queue<LL , vector<LL> , greater<LL> >pq;
set<LL>s;
pq.push(1);
s.insert(1);
for(int i = 1 ; ; i++){
LL x = pq.top();
pq.pop();
if(i == 1500){
printf("The 1500'th ugly number is %d.\n",x);
break;
}
for(int j = 0 ; j < 3 ; j++){
LL x2 = x * coef[j];
if(!s.count(x2)){
s.insert(x2);
pq.push(x2);
}
}
}
return 0;
}