csuoj1321

最短路

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<algorithm>
#include<time.h>
#include<stdlib.h>
#include<cmath>
using namespace std;
const int maxn=10005;
#define mod 1000000007
long long ans[maxn];
void init()
{
    ans[0]=ans[1]=1;
    for (int i=2;i<maxn;i++)
    {
        for(int j=0;j<=i-1;j++)
        {
            ans[i]+=(ans[j]*ans[i-j-1])%mod;
            //ans[i]=ans[i]%mod;
        }
        ans[i]=ans[i]%mod;
    }
    return ;
}
int main()
{
    init();
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        printf("%lld\n",ans[n]);
    }
    return 0;
}