HDU 1246（自共轭Ferrers图）

#include <iostream>
using namespace std;
const int MAXN = 305;

int num[MAXN];

int main()
{
	num[0] = num[1] = 1;
	for (int i = 3; i < MAXN; i += 2)
	{
		for (int j = MAXN - i; j >= 0; j--)
			if (i + j < MAXN)
				num[i + j] += num[j];
	}

	int n;
	while (cin >> n)
	{
		cout << num[n] << endl;
	}
	return 0;
}