51nod 1201 整数划分 dp

#pragma comment(linker, "/STACK:1024000000,1024000000")
#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<queue>
#include<algorithm>
#include<stack>
#include<cstring>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<map>
#include<time.h>
using namespace std;
#define LL long long
#define bug(x)  cout<<"bug"<<x<<endl;
const int N=5e4+10,M=1e6+10,inf=1e9+10,MOD=1e9+7;
const LL INF=1e18+10,mod=1e9+7;
const double eps=(1e-8),pi=(4*atan(1.0));

int dp[N][500];
int main()
{
    dp[0][0]=1;
    for(int i=1;i<=50000;i++)
    {
        for(int j=1;i>=j&&j<=400;j++)
            dp[i][j]=(dp[i-j][j-1]+dp[i-j][j])%mod;
    }
    int n,ans=0;
    scanf("%d",&n);
    for(int i=1;i<=400;i++)
        ans+=dp[n][i],ans%=mod;
    printf("%d\n",ans);
    return 0;
}