UVA

#include <cstdio>#include <cstring>#include <iostream>#include <algorithm>#include <cmath>using namespace std;const int maxn = 10005;long long n3[maxn], dp[maxn];int main() {    memset(n3, 0, sizeof(n3));    memset(dp, 0, sizeof(dp));    for (int i = 0; i <= 21; i++) n3[i] = i * i * i;    dp[0] = 1;    for (int i = 1; i <= 21; i++) {        for (int j = n3[i]; j < maxn; j++) {            dp[j] += dp[j - n3[i]];        }    }    int n;    while (~scanf("%d", &n)) {        printf("%lld\n", dp[n]);    }    return 0;}