五边形定理。。。。看不懂的说
#include<bits/stdc++.h>
using namespace std;
const int mod=1e9+7;
const int MAXN=50050;
int dp[MAXN];
int main()
{
int n,i,j;
while(~scanf("%d",&n))
{
dp[0]=1;
for(i=1;i<=n;i++)
{
for(j=1;((j*(3*j-1))>>1)<=i;j++)
{
if(j&1)
dp[i]=(dp[i]+dp[i-((j*(3*j-1))>>1)])%mod;
else
dp[i]=(dp[i]-dp[i-((j*(3*j-1))>>1)]+mod)%mod;
}
for(j=1;((j*(3*j+1))>>1)<=i;j++)
{
if(j&1)
dp[i]=(dp[i]+dp[i-((j*(3*j+1))>>1)])%mod;
else
dp[i]=(dp[i]-dp[i-((j*(3*j+1))>>1)]+mod)%mod;
}
}
printf("%d\n",dp[n]);
}
}