【catalan数】10076 - 凸多边形分割

 1 # include<cstdio> 2 # include<iostream> 3 using namespace std; 4 const int maxn=250; 5 typedef unsigned long long LL; 6 LL f[maxn]; 7 int main(){ 8     LL n;cin>>n; 9     f[2]=f[3]=1;10     for(int i=4;i<=250;i++)11     for(int j=2,k=i-1;j<=i-1;j++,k--)12     f[i]=(f[i]+f[j]*f[k])%1234567;13     printf("%d",f[n]);14     return 0;15 }//µÝÍÆ