zcmu—1225: Give me the answer

题目描述

 

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)

输入

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 <stdio.h>
const int mod=1000000000;
int a[1000001];
int f(int n)
{
	int i;
	a[0]=1;a[1]=1;
	for(i=2;i<=n;i++)
	{
		if(i%2==0)
			a[i]=(a[i-2]+a[i/2])%mod;
		else
			a[i]=a[i-1]%mod;
	}
}
int main()
{
	int t;
	int n;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		f(n);
		printf("%d\n",a[n]);
	}
	return 0;
}