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
题意:
给你一个数n。
只能用2的幂次来组成n。
求一共有多少种组成方式;
代码:
#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
#define ll long long
using namespace std;
const int mod=1e9;
const int maxn=1e6+10;
ll f[1000009];
ll c[100];
void init()
{
c[0]=1;
for(int i=1;;i++)
{
c[i]=c[i-1]*2;
if(c[i]>maxn)
{
break;
}
}
}
int main()
{
init();
int n;
scanf("%d",&n);
f[0]=1;
for(int i=0;c[i]<=n;i++)
{
for(int j=c[i];j<=n;j++)
{
f[j]+=f[j-c[i]];
if(f[j]>mod)
f[j]%=mod;
}
}
cout<<f[n]<<endl;
}