题目链接:
http://acm.csu.edu.cn/OnlineJudge/problem.php?id=1320
题解:
贴一下越大爷的博客:
http://blog.csdn.net/tjandbj/article/details/51495609
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int mod=1000000007;
long long f[10005];
int n;
int main()
{
f[0]=1;
for(int i=1;i<=10000;i++)
for(int j=0;j<i;j++)
f[i]=((f[j]*f[i-1-j])%mod+f[i])%mod;
while(scanf("%d",&n)!=EOF)
{
printf("%lld\n",f[n]);
}
return 0;
}