HDOJ 题目2709Sumsets（递推）

最新推荐文章于 2018-11-11 14:50:16 发布

Jogging_Clown

最新推荐文章于 2018-11-11 14:50:16 发布

阅读量2k

点赞数

分类专栏：递推

本文链接：https://blog.csdn.net/yu_ch_sh/article/details/38434643

版权

递推专栏收录该内容

27 篇文章 0 订阅

订阅专栏

Sumsets

Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1460 Accepted Submission(s): 574

Problem Description

Farmer John commanded his cows to search for different sets of numbers that sum to a given number. The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that sum to 7:

1) 1+1+1+1+1+1+1
2) 1+1+1+1+1+2
3) 1+1+1+2+2
4) 1+1+1+4
5) 1+2+2+2
6) 1+2+4

Help FJ count all possible representations for a given integer N (1 <= N <= 1,000,000).

Input

A single line with a single integer, N.

Output

The number of ways to represent N as the indicated sum. Due to the potential huge size of this number, print only last 9 digits (in base 10 representation).

Sample Input

Sample Output

Source

USACO 2005 January Silver

Recommend

teddy | We have carefully selected several similar problems for you: 2544 2717 2715 2159 1114

思路：本打算用母函数做的，结果果然超时了，，而且还是先打的表，不会做就网上搜了一下，发现这么做的，，，（打死我也想不出来啊）

递推.

一、当n为奇数时，a[n]=a[n-1];

二、当n为偶数时有两种情况：

1、n=n-2+1+1；

2、n=n/2*2;

所以：a[n]=a[n-2]+a[n/2];

ac代码

#include<stdio.h>
int a[1000010];
void fun()
{
	int i;
	a[1]=1;
	a[2]=2;
	for(i=3;i<=1000010;i++)
	{
		if(i&1)
			a[i]=a[i-1]%1000000000;
		else
			a[i]=(a[i-2]+a[i/2])%1000000000;
	}
}
int main()
{
	int n;
	fun();
	while(scanf("%d",&n)!=EOF)
	{
		printf("%d\n",a[n]);
	}
}