Sumsets

Sumsets

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

Sample Input
7
Sample Output
6

/*这题主要用到了递归。
因为只能用2的幂来划分n，所以如果输入的数n是奇数，则一定会有1，把n减去1后，它的化分数与n-1一样。
如果n是偶数，分两种情况讨论：
1.没有1，则此时n的化分数与n/2一样；
2.2个1，此时n的化分数与n-2一样。*/

#include <iostream>
using namespace std;
long s[1000001];
int main() {
    int n;
    s[1] = 1;
    s[2] = 2;
    for (n = 3; n < 1000001; n++) {
        if (n % 2 == 1) s[n] = s[n - 1];
        else s[n] =( s[n - 2] + s[n / 2])%1000000000;
    }
    while (cin >> n) {
        cout << s[n] << endl;
    }
    return 0;
}