UVA_11137_Ingenuous Cubrency

#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<list>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<algorithm>
#pragma warning(disable:4996)
#include<cstdio>
#include<cstdlib>
using std::cin;
using std::cout;
using std::endl;
using std::stringstream;
using std::string;
using std::vector;
using std::list;
using std::pair;
using std::set;
using std::multiset;
using std::map;
using std::multimap;
using std::stack;
using std::queue;
using std::priority_queue;
int main()
{
	//freopen("input.txt", "r", stdin);  
	//freopen("output.txt", "w", stdout);  
	vector<long long>coin;
	for (long long i = 1; i <= 21; i++)
	{
		coin.push_back({ i*i*i });
	}
	vector<long long>dp(10001);dp[0] = 1;
	for (size_t i = 0; i < coin.size(); i++)
	{
		for (size_t j = 0; j <= 10000 - coin[i]; j++)
		{
			dp[j + coin[i]] += dp[j];
		}
	}
	int n;
	while (cin >> n)
	{
		cout << dp[n] << endl;
	}
	return 0;
}