poj 1338 Ugly Numbers [ 离线预处理 - 只处理丑数，复杂度很低 此题也是 程序猿的经典面试题]

#include <iostream>
#include <string>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <vector>
#include <stack>
#include <deque>
#include <queue>
#include <bitset>
#include <list>
#include <map>
#include <set>
#include <iterator>
#include <algorithm>
#include <functional>
#include <utility>
#include <sstream>
#include <climits>
#include <cassert>
#define MID(x,y) ( ( x + y ) >> 1 )
#define L(x) ( x << 1 )
#define R(x) ( x << 1 | 1 )
#define BUG puts("here!!!");
#define STOP system("pause");

using namespace std;
const int N = 1505;

int Min(int a, int b, int c) {
	return min(a, min(b, c));
}
int *pa = new int[N];
void solve(int index) {
	pa[1] = 1;
	int *p2 = pa + 1;
	int *p3 = p2;
	int *p5 = p2;
	int count = 1;
	while(count < index) {
		int minv = Min(*p2 * 2, *p3 * 3, *p5 * 5);
		pa[++count] = minv;
		while(*p2 * 2 <= minv) {
			p2++;
		}
		while(*p3 * 3 <= minv) {
			p3++;
		}
		while(*p5 * 5 <= minv) {
			p5++;
		}
	}
}
int main() {
	solve(1500);
	int k;
	while(cin >> k, k) {
		printf("%d\n", pa[k]);
	}
	return 0;
}