HDU4651+数学公式

/*
数学公式
ans[i]:i可以有ans[i]种方法得到。（由1-i的数相加）
*/
#include<stdio.h>
typedef long long int64;
const int maxn = 100000;
const int64 mod = 1000000007;
int64 ans[ maxn+15 ];
void init(){
int64 flag,k;
ans[ 0 ] = 1;
for( int64 i=1;i<=maxn;i++ ){
flag = 1;
k = 1;
int64 Ans = 0;
while( 1 ){
int64 pos1 = (3*k*k-k)/2;
int64 pos2 = (3*k*k+k)/2;
if( pos1>i ) break;
Ans = (Ans+flag*ans[ i-pos1 ]+mod)%mod;
if( pos2>i ) break;
Ans = (Ans+flag*ans[ i-pos2 ]+mod)%mod;
flag = -flag;
k++;
}
ans[ i ] = Ans;
}
}
void test( ){
printf("%d\n",13%20);
printf("%d\n",-13%20);
printf("%d\n",-13%5);
}
int main(){
int T;
//test();
scanf("%d",&T);
init();
while( T-- ){
int n;
scanf("%d",&n);
printf("%lld\n",ans[ n ]);
}
return 0;
}