POJ - 1338 Ugly Numbers-STL的灵活运用

1
2
9
0

1
2
10

map拥有自动排序的强大功能

/*
Author: 2486
Memory: 680 KB		Time: 16 MS
Language: G++		Result: Accepted
*/
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <iterator>
using namespace std;
typedef long long LL;
const int maxn=1500+5;
int S[]= {2,3,5};
LL dp[maxn];
priority_queue<LL,vector<LL>, greater<LL> >G;
map<LL,int>P;
int n;
void pri() {
G.push(1);
P[1]=1;
int cnt=0;
while(true) {
LL a=G.top();
G.pop();
cnt++;
if(cnt>1500+4)break;
for(int i=0; i<3; i++) {
LL b=a*S[i];
if(!P[b]) {
P[b]=1;
G.push(b);
}
}
}
map<LL,int>::iterator it;
cnt=1;
for(it=P.begin(); it!=P.end(); it++) {
dp[cnt++]=it->first;
if(cnt>1500)return;
}
}
int main() {
pri();
while(~scanf("%d",&n),n) {
printf("%I64d\n",dp
);
}
return 0;
}