题目链接
递推公式:h(n)=h(n-1)*(4*n-2)/(n+1);
求的过程中数过大所以求下 mod
/*
卡特兰数
递推公式 Catanlan[n] = Catanlan[n-1] * (4 * n - 2)/(n+1);
*/
#include<cstdio>
const int maxn = 1000010;
const int mod = 1000000007;
long long inv[maxn + 5];
long long Catalan[maxn];
void Solve(){
inv[1] = 1;
for(int i = 2; i < maxn - 1; i++)
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
Catalan[1] = 1;
for(int i = 2; i < maxn - 1; ++i)
Catalan[i] = ( ( ( Catalan[i - 1] * (4 * i - 2) )% mod ) * inv[i + 1] ) % mod;
int main(){
Solve();
int t,n,ic=1;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
printf("Case #%d:\n%lld\n",ic++,Catalan[n]);
}
return 0;
}