<h1 id="heading">题目</h1>
<blockquote>
<h2 id="description">Description</h2>
<blockquote>
People in Cubeland use cubic coins. Not only the unit of currency is 
called a cube but also the coins are shaped like cubes and their values 
are cubes. Coins with values of all cubic numbers up to 9261(= 213 
), 
i.e., coins with the denominations of 1, 8, 27, . . ., up to 9261 cubes, 
are available in Cubeland. 
Your task is to count the number of ways to pay a given amount 
using cubic coins of Cubeland. For example, there are 3 ways to pay 
21 cubes: twenty one 1 cube coins, or one 8 cube coin and thirteen 1 
cube coins, or two 8 cube coin and five 1 cube coins.
 
</blockquote>
<h2 id="input">Input</h2>
<blockquote>
Input consists of lines each containing an integer amount to be paid. You may assume that all the 
amounts are positive and less than 10000.
</blockquote>
<h2 id="output">Output</h2>
<blockquote>
For each of the given amounts to be paid output one line containing a single integer representing the 
number of ways to pay the given amount using the coins available in Cubeland.
</blockquote>
<h2 id="sample-input">Sample Input</h2>
<blockquote>
10 
21 
77 
9999
</blockquote>
<h2 id="sample-output">Sample Output</h2>
<blockquote>
2 
3 
22 
440022018293
</blockquote>
</blockquote>
<h1 id="heading-1">题解</h1>
判断立方数组成 <code>n</code> 的方案数 
<a href="http://www.oyohyee.com/post/Algorithm/Package_Problem.html#%E5%AE%8C%E5%85%A8%E8%83%8C%E5%8C%85%E9%97%AE%E9%A2%98">&gt;背包问题 完全背包问题&lt;</a>
输出需要使用 <code>long long</code>
<h1 id="heading-2">代码</h1>
<pre style="background-color:#fff">/*
By:OhYee
Github:OhYee
Blog:http://www.oyohyee.com/
Email:oyohyee@oyohyee.com

かしこいかわいい？
エリーチカ！
要写出来Хорошо的代码哦~
*/
#include &lt;cstdio&gt;
#include &lt;algorithm&gt;
#include &lt;cstring&gt;
#include &lt;cmath&gt;
#include &lt;string&gt;
#include &lt;iostream&gt;
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;map&gt;
#include &lt;set&gt;
#include &lt;functional&gt;
#include &lt;bitset&gt;
using namespace std;

const int INF = 0x7FFFFFFF;
const int maxn = 10005;

int v;
long long dp[maxn];

void CompletePack(int cost) {
 for(int i = cost; i &lt;= v; i++)
 dp[i] += dp[i - cost];
}

bool Do() {
 if(!(cin &gt;&gt; v))
 return false;
 
 memset(dp,0,sizeof(dp));
 dp[0] = 1;

 for(int i = 1;i &lt;= 21;i++)
 CompletePack(i*i*i);

 cout &lt;&lt; dp[v]&lt;&lt;endl;

 return true;
}

int main() {
 while(Do());
 return 0;
}
</pre>

Uva 11137.Ingenuous Cubrency