Ingenuous Cubrency UVA 11137

递推 

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>   
#include <ctime>
 
using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;
using std::endl;

const int MAXN(10000);

long long table[MAXN+10];

int main()
{
	int temp;
	table[0] = 1LL;
	for(int i = 1; (temp = i*i*i) <= MAXN; ++i)
	{
		for(int j = temp; j <= MAXN; ++j)
			table[j] += table[j-temp];
	}
	int n;
	while(~scanf("%d", &n))
		printf("%lld\n", table[n]);
	return 0;
}

生成函数

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <algorithm>
#include <vector>
#include <cstring>
#include <stack>
#include <cctype>
#include <utility>   
#include <map>
#include <string>  
#include <climits> 
#include <set>
#include <string> 
#include <sstream>
#include <utility>   
#include <ctime>
 
using std::priority_queue;
using std::vector;
using std::swap;
using std::stack;
using std::sort;
using std::max;
using std::min;
using std::pair;
using std::map;
using std::string;
using std::cin;
using std::cout;
using std::set;
using std::queue;
using std::string;
using std::istringstream;
using std::make_pair;
using std::greater;
using std::endl;

const int MAXN(10000);

int add[100];
long long table[2][MAXN+10];
int count;

int main()
{
	int temp;
	for(count = 1;(temp = count*count*count) <= MAXN; ++count)
		add[count] = temp;
	int cur = 0, last = 1;
	table[last][0] = 1LL;
	for(int i = 1; i < count; ++i)
	{
		memset(table[cur], 0, sizeof(table[cur]));
		for(int j = 0; j <= MAXN; ++j)
			for(int k = 0; j+k <= MAXN; k += add[i])
				table[cur][j+k] += table[last][j];
		cur ^= 1;
		last ^= 1;
	}
	int n;
	while(~scanf("%d", &n))
	{
		printf("%lld\n", table[last][n]);
	}
	return 0;
}