POJ1338~~~~~~丑数（经典dp）

#include<iostream>#include<cstring>#include<cstdio>#include<algorithm>using namespace std;int a[1510];void s(){int num2 = 1, num3 = 1, num4 = 1;a[1] = 1;for (int i = 2; i <= 1500; i++){a[i] = min(a[num2] * 2, min(a[num3] * 3, a[num4] * 5));if (a[i] == a[num2]*2) num2++;if (a[i] == a[num3]*3) num3++;if (a[i] == a[num4]*5) num4++;}}int main(){s();int n;while (cin >> n){if (n == 0) break;cout << a[n] << endl;}cout << endl;return 0;}