本题看着恶心啊,推出了前三个
1 1
2 2
3 5
就看不下去了,就过冒出个新知识Catalan数。
为1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904147324, 4861946401452, ...
h(n)= h(0)*h(n-1)+h(1)*h(n-2) + ... + h(n-1)h(0) (n>=2)
例如:h(2)=h(0)*h(1)+h(1)*h(0)=1*1+1*1=2
h(3)=h(0)*h(2)+h(1)*h(1)+h(2)*h(0)=1*2+1*1+2*1=5
h(n)=h(n-1)*(4*n-2)/(n+1);
递推关系的解为:
h(n)=C(2n,n)/(n+1) (n=0,1,2,...)
递推关系的另类解为:
h(n)=c(2n,n)-c(2n,n+1)(n=0,1,2,...)
代码:
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int main()
{
long long s;
int n;
cin>>n;
s=1;
for(int i=2;i<=n;i++)
s=s*(4*i-2)/(i+1);
cout<<s;
return 0;
}