// UVa 11137 - Ingenuous Cubrency
#include <iostream>
#include <string.h>
using namespace std;
#define datatype unsigned long long int
int main() {
int cube[22];
for (int j = 1; j <= 21; j++)
cube[j] = j * j * j;
datatype T[10000];
memset(T, 0, sizeof(T));
T[0] = 1;
for (int j = 1; j <= 21; j++)
for (int i = cube[j]; i < 10000; i++)
T[i] += T[i - cube[j]];
int n;
while (cin >> n) {
cout << T[n] << endl;
}
return 0;
}
No comments:
Post a Comment