预处理
const int maxn = 1e7 + 10;
const int mod = 1e9 + 7;
ll mul[maxn];
ll inv[maxn];
void init() {
mul[0] = 1;
for (int i = 1; i < maxn; i++) {
mul[i] = (mul[i - 1] * i) % mod;
}
inv[0] = inv[1] = 1;
for (int i = 2; i < maxn; i++) {
inv[i] = (ll) (mod - mod / i) * inv[mod % i] % mod;
}
for (int i = 1; i < maxn; i++) {
inv[i] = (inv[i - 1] * inv[i]) % mod;
}
}
ll C(int n, int m) {
return mul[n] * inv[m] % mod * inv[n - m] % mod;
}
ll A(int n, int m) {
return mul[n] * inv[n - m] % mod;
}
卡特兰数
其前几项为(从第零项开始) : 1, 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, …
满足关系:
1.
C
n
+
1
=
C
0
C
n
+
C
1
C
n
−
1
+
.
.
.
+
C
n
C
0
1. C_{n+1} = C_0 C_n + C_1 C_{n-1} + ... + C_n C_0
1.Cn+1=C0Cn+C1Cn−1+...+CnC0
2.
(
n
−
3
)
C
n
=
n
2
C
3
C
n
−
1
+
C
4
C
n
−
2
+
.
.
.
+
C
n
−
1
C
3
2. (n - 3) C_n = \frac{n}{2} C_3 C_{n-1} + C_4 C_{n-2} + ... + C_{n-1} C_3
2.(n−3)Cn=2nC3Cn−1+C4Cn−2+...+Cn−1C3
卡特兰数的第 n 项
h
(
n
)
=
C
2
n
n
−
C
2
n
n
−
1
h(n)=C^{n}_{2n} - C^{n-1}_{2n}
h(n)=C2nn−C2nn−1
Lucas定理
用来求
C
m
n
C^{n}_{m}
Cmn 取 mod 的值
令n=sp+q, m=tp+r (q, r ≤p)
那么:
时间复杂度:O(logp(n)*p)
const int mod = 10007;
ll QuickPow(ll x, ll N) {
ll res = x % mod;
ll ans = 1;
while (N) {
if (N & 1) {
ans = ans * res % mod;
}
res = res * res % mod;
N = N / 2;
}
return ans % mod;
}
ll C(ll n, ll m) {
if (m > n) {
return 0;
}
ll ans = 1;
for (int i = 1; i <= m; i++) {
ll a = (n + i - m) % mod;
ll b = i % mod;
ans = ans * (a * QuickPow(b, mod - 2) % mod) % mod;
}
return ans;
}
ll lucas(ll a, ll b) {
if (b == 0) {
return 1;
}
return C(a % mod, b % mod) * lucas(a / mod, b / mod) % mod;
}