线性递推预处理阶乘求解组合数模板

ll fact[N], infact[N];

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

void init()
{
    fact[0] = infact[0] = 1;
    for (int i = 1; i < N; i++)
        fact[i] = fact[i - 1] * i % mod;
    infact[N - 1] = qmi(fact[N - 1], mod - 2, mod);
    for (int i = N - 2; i >= 1; i--)
        infact[i] = infact[i + 1] * (i + 1) % mod;
}

ll C(ll n, ll m)
{
    if (n < m)
        return 0;
    return fact[n] * infact[m] % mod * infact[n - m] % mod;
}