zcmu-1225: Give me the answer（找规律）

题目描述

Farmer John commanded his cows to searchzcmu- 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)

输入

The first line of the input contains the number of test cases in the file. And t he first line of each case
contains one integer numbers n

输出

For each test case, output a line with the ans % 1000000000.

样例输入

1 7

样例输出

6

代码：

#include<bits/stdc++.h>

using namespace std;

    int a[1000005];

int main(){

    int w;

    cin>>w;

    while(w--){

    int t;

    cin>>t;

    a[1]=1;

    a[2]=2;

    for(int i=3;i<=t;i++){

        if(i%2!=0){

            a[i]=a[i-1];

        }

        else{

            a[i]=a[i/2]+a[i-2];

        }

        a[i]%= 1000000000;

    }

    cout<<a[t]<<endl;

}

}