排列组合
A(n,m) = (n!)/(n - m)!
C(n,m) = (n!)/((n - m)!* m!)
基本定理:
C(n,0)* C(n,1)*…*C(n,n) = 2 ^ n
C(n,r) + C(n,r + 1) = C(n + 1,r + 1)
C(n,0) = 1
C(n,i) = C(n,i - 1) * (n - i + 1) / i
D(1) = 0;D(n) = (n - 1) * (D(n - 1) + D(n - 2)) 错排
基本模型:
Ⅰ隔板法
x1 + x2 + … + xm = n(xi > 0)问解数
C(n - 1, m - 1)
x1 + x2 + … + xm = n(xi>=0)问解数
C(n + m - 1, m - 1)
x1 + x2 + … + xm <= n(xi>0)问解数
等价于(x0>=0)x0 + x1 + x2 + … + xm = n
C(n, m)
x1 + x2 + … + xm = n(0 < xi <= ai)问解数
其它定理:
- lucas:大组合数取模
/*
ll C(ll a,ll b)
{
if(b > a) return 0;
b = min(b,a - b);
ll up = 1,down = 1;
for(int i = 0 ; i < b; ++i) {
up = up * (a - i) % mod;
down = down * (i + 1) % mod;
}
return up * mul(down,mod - 2) % mod;
}//神速 (一乘一除最快最省事)
ll lucas(ll a,ll b)
{
if(!b) return 1;
return C(a % mod,b % mod) * lucas(a / mod,b / mod) % mod;
}
*/