数学板块学习之组合数

组合数

$C_n^m$也写做$\left(\genfrac{}{}{0ex}{}{n}{m}\right)$，其实$\left(\genfrac{}{}{0ex}{}{n}{m}\right)$比较正宗，但是习惯上还是喜欢$C_n^m$

$$C_n^m=\frac{n!}{m!(n-m!)}$$
求和公式($k=1.2.\cdots n$)：
$S(k)=\frac{n(n+1)}{2}$
$S(2k-1)=n^2$
$S(k^2)=\frac{n(n+1)(2n+1)}{6}$
$S((2k-1{)}^2)=\frac{n(4n^2-1)}{3}$
$S(k^3)=n^2(2n^2-1)$
$S((2k-1{)}^3)=n^2(2n^2-1)$
$S(k^4)=\frac{n(n+1)(2n+1)(3n^2+3n-1)}{30}$
$S(k^5)=\frac{n^2(n+1{)}^2(2n^2+2n-1)}{12}$
$S(k(k+1))=\frac{n(n+1)(n+2)}{3}$
$S(k(k+1)(k+2))=\frac{n(n+1)(n+2)(n+3)}{4}$
$S(k(k+1)(k+2)(k+3))=\frac{n(n+1)(n+2)(n+3)(n+4)}{5}$

常见公式:
$C_m^n=C_m^{m-n}$

$C_m^n{C}_n^r=C_m^r{C}_{m-r}^{n-r}$

$C_m^n=C_{m-1}^n+C_{m-1}^{n-1}$

$C_m^0-C_m^1+C_m^2-\cdots \pm C_m^m=0$

${\sum }_{i=0}^m{C}_m^i{x}_i=(x+1{)}^m$

$C_{m+r+1}^r={\sum }_{i=0}^r{C}_{m+i}^i$

${\sum }_{i=0}^m{C}_m^i=2^m$

递推法代码

int comb[maxn][maxn];
const int MOD = 1e9+7;
int main(){
    for(int i = 0; i < maxn; ++i){
        comb[i][0] = comb[i][i] = 1;
        for(int j = 1; j < i; ++j){
            comb[i][j] = comb[i-1][j] + comb[i-1][j-1];
            comb[i][j] %= MOD;
        }
    }
}

但是明显复杂度高达$O(n^2)$

在$O(n)$时间内求阶乘

typedef long long ll;
const int maxn = 50000;
const double INF = 0x3f3f3f3f;
const int MOD = 1e9+7;


ll F[maxn],Finv[maxn],inv[maxn];//F是阶乘，Finv是逆元的阶乘 
void init(){
    inv[1] = 1;
    for(ll i = 2; i < maxn; ++i){
        inv[i] = (MOD-MOD/i)*inv[MOD%i]%MOD;
    }
    F[0] = Finv[0] = 1;
    for(ll i = 1; i < maxn; ++i){
        F[i] = F[i-1]*i%MOD;
        Finv[i] = Finv[i-1]*inv[i]%MOD;
    }
}
ll comb(int n,int m){//C[n][m]
    if(m < 0 || m > n) return 0;
    return F[n]*Finv[n-m]%MOD*Finv[m]%MOD;
}
int main(){
    init();
    
    return 0;
}