来自这个题 : 打牌的贝贝
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include <algorithm>
using namespace std;
const int N = 1e6 + 10;
typedef long long ll;
const ll mod = 1e9 + 7;
ll gcd(ll x, ll y) { return y > 0 ? gcd(y, x % y) : x; }
ll fac[2 * N], ifac[N], invx[N], f[N];//阶乘,阶乘逆元,逆元,卡特兰数
ll kum(ll x, ll y)
{
ll ans = 1;
while (y)
{
if (y & 1)
{
ans = ans * x % mod;
}
y >>= 1;
x = x * x % mod;
}
return ans;
}
void init()
{
int R = N - 1;
fac[0] = 1;
for (int i = 1; i <= R; i++)
{
fac[i] = fac[i - 1] * i % mod;//阶乘
}
ifac[0] = 1;
ifac[R] = kum(fac[R], mod - 2);
for (int i = R; i >= 2; i--)
{
ifac[i - 1] = ifac[i] * i % mod;//阶乘逆元
}
for (int i = 1; i <= R; i++)
{
invx[i] = fac[i-1] * ifac[i] % mod;//分数逆元
}
f[0] = 1;
for (int i = 1; i <= R; i++)
{
f[i] = (4 * i - 2) * f[i - 1] % mod * invx[i + 1] % mod;//卡特兰数
}
}
ll C(ll x, ll y)
{
return fac[x] * ifac[y] % mod * ifac[x - y] % mod;
}
void solve()
{
ll n;
cin >> n;
cout << (C(2 * n, n) - f[n]+mod)%mod << " " << f[n] << "\n";
}
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
int t;
cin >> t;
init();
while (t--)
{
solve();
}
return 0;
}
这是当时过题的代码,提取一下板子(我承认我在水字数。。。。。。。。。。。。。。。。。)
组合数模板(含逆元) O(n)预处理, O(1)查询
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
int fac[N], ifac[N];//阶乘,阶乘逆元,逆元,卡特兰数
ll kum(ll x, ll y)
{
ll ans = 1;
while (y)
{
if (y & 1)
{
ans = ans * x % mod;
}
y >>= 1;
x = x * x % mod;
}
return ans;
}
void init()
{
int R = 1e6;
fac[0] = 1;
for (int i = 1; i <= R; i++)
{
fac[i] = fac[i - 1] * 1ll * i % mod;//阶乘
}
ifac[0] = 1;
ifac[R] = kum(fac[R], mod - 2);
for (int i = R; i >= 2; i--)
{
ifac[i - 1] = ifac[i] * 1ll * i % mod;//阶乘逆元
}
}
ll C(int x, int y)
{
//if(x == y) return 1;
if(x < y) return 0;
return fac[x] * 1ll * ifac[y] % mod * 1ll * ifac[x - y] % mod;
}
用的时候直接粘过去就行了, 啊哈哈哈哈哈。。。。。。。。。。。。
只要模板的人现在可以走了,下面是例题的环节(水字数)
例题
(一会再搞)