POJ 2229 Sumsets (递推&整数划分变形)

标签：dp   递推   整数划分变形   

http://poj.org/problem?id=2229

/*63ms,4300KB*/

#include<cstdio>
const int mod = 1e9;
const int maxn = 1000001;

int f[maxn];

int main()
{
	int n, i;
	f[1] = 1, f[2] = 2;
	for (i = 3; i < maxn; ++i)
		f[i] = (i & 1 ? f[i - 1] : (f[i - 2] + f[i >> 1]) % mod) ;
	while (~scanf("%d", &n))
		printf("%d\n", f[n]);
	return 0;
}

POJ 2229 Sumsets (递推&整数划分变形)

标签：dp   递推   整数划分变形   

原文地址：http://blog.csdn.net/acm_10000h/article/details/41120485