POJ2229-Sumsets

 题目链接                                                                     Sumsets

Time Limit: 2000MS		Memory Limit: 200000K
Total Submissions: 23182		Accepted: 8887

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

7

Sample Output

6

Source

USACO 2005 January Silver

思路:

先自己思考，这是一道简单dp！

 

注意数据:4    1111  112  22 4    如果该数字满足2的次幂的话它本身也算一个

代码:

#include<iostream>
#include<cstdio>
#include<algorithm> 
using namespace std;
long long int dp[1000005]={0,1,2,2,4,4,6,6,10,10};
int main()
{
	int n;
	for(int i=4;i<=1000000;i++){
		if(i&1) dp[i]=dp[i-1];
		else dp[i]=(dp[i-2]+dp[i>>1])%1000000000;
	}
	while(scanf("%d",&n)!=EOF){
		printf("%lld\n",dp[n]);
	}
}