AcWing 889 满足条件的01序列 题解（卡特兰数/求组合数）

卡特兰数的思路：把求合法01的排列转化为求二维平面上到达（n, n）点合法（y <= x）路径的数量

#include<iostream>

using namespace std;

typedef long long  ll;

const int mod = 1e9 + 7;

int n;

int qmi(int a, int k, int p){
	int res = 1;
	while(k){
		if(k & 1) res = (ll)res * a % p;
		a = (ll)a * a % p;
		k >>= 1;
	}
	return res;
}

int main()
{
	cin>>n;
	int a = 2 * n, b = n;
	int res = 1;
	for(int i = a; i > a - b; i -- ) res = (ll)res * i % mod;
	for(int i = 1; i <= b; i ++ ) res = (ll) res * qmi(i, mod - 2, mod) % mod;
	
	res = (ll)res * qmi(n + 1, mod - 2, mod) % mod;
	
	cout<<res<<endl;
	return 0;
}