题意如下:
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).
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,求解该整数n有多少种由2的幂次之和组成的方案。
我们用f[i]表示i的拆分方案数,显然,f[1]=1,然后考虑:如果i为奇数,那么i的拆分方案里一定会有一个1,除去这个1,剩下的方案数和i-1相同,所以f[i]=f[i-1]。
如果i为偶数,那么i的拆分方案有两种情况:
1.含有1,那么就和i-1的情况相同;
2.不含有1,那么也就是说拆分后的各个因子都是偶数,如果把所有因子都除以二,那么就和i/2的拆分方案一一对应。
所以f[i]=f[i-1]+f[i/2]。
然后就递推呗!
#include <iostream>
#include <cstdio>
#define mod 1000000007
using namespace std;
inline int read(void){
int x=0,f=1; char ch=getchar();
for(;ch<'0'||ch>'9';ch=getchar()) if(ch=='-') f=-1;
for(;ch>='0'&&ch<='9';x=x*10+ch-'0',ch=getchar());
return x*f;
}
const int maxn=1000009;
static long long f[maxn];
int main(int argc, char const *argv[]){
// freopen("split.in","r",stdin);
// freopen("split.out","w",stdout);
int n=read(); f[1]=1;
for(int i=2;i<=n;i++){
if(i%2) f[i]=f[i-1]%mod;
else f[i]=f[i-1]%mod+f[i/2]%mod;
}
cout<<f[n]%mod<<endl;
return 0;
}