题目大意:给定n个1和m个0,能组成多少种序列,满足对于任意前缀1的个数>=0的个数
题解:http://www.cnblogs.com/jianglangcaijin/p/3443689.html
时隔多年我终于明白了卡特兰数怎么求QAQ
我真是太蒟蒻了QAQ
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define MOD 20100403
using namespace std;
//C(n+m,n)-C(n+m,n+1)
long long n,m;
long long Quick_Power(long long x,long long y)
{
long long re=1;
while(y)
{
if(y&1) (re*=x)%=MOD;
(x*=x)%=MOD; y>>=1;
}
return re;
}
long long Factorial(long long n)
{
long long re=1;
int i;
for(i=1;i<=n;i++)
(re*=i)%=MOD;
return re;
}
long long C(long long n,long long m)
{
return Factorial(n)*Quick_Power(Factorial(m),MOD-2)%MOD*Quick_Power(Factorial(n-m),MOD-2)%MOD;
}
int main()
{
int i;
cin>>n>>m;
cout<<(C(n+m,n)-C(n+m,n+1)+MOD)%MOD<<endl;
return 0;
}