Partition Numbers的计算

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#define ll long long
using namespace std;
ll dp[200];
ll p(int x){
	if(x<0)return 0;
	if(x<=1)return 1;
	if(dp[x])return dp[x];
	int ans=0;
	for(int i=1;i<=x;i++){
		ans+=(ll)(i%2?1:-1)*(p(x-i*(i*3-1)/2)+p(x-i*(i*3+1)/2));
	}
	return dp[x]=ans;
}
int main() {
	for(int i=1;i<=121;i++)
	printf("a(%d)=%lld\n",i,p(i));
	return 0;
}

#include <cstdio>
#define ll long long
using namespace std;
#define N 100001
const ll M = 1e9+7;
int B[N]={1,1,2};
void get(int i){
    for(int j=1;;++j)
    for(int k=-1;k<2;k+=2){
        int w=(3*j*j+k*j)/2;
        if(w>i)return;
        if(j%2)B[i]=(B[i]+B[i-w])%M;
        else B[i]=(B[i]-B[i-w]+M)%M;
    }
}
int t,n;
int main() {
    for(int i=3;i<N;++i)
        get(i);
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        printf("%d\n",B[n]);
    }
    return 0;
}