求组合数模板

typedef long long ll;
const ll mod = 1e9+7;
const int mmax = 1e5 + 10;
ll fac[mmax + 5];
ll inv[mmax + 5];
ll qpow(ll a, ll b) 
{ 
    ll r = 1, t = a; 
    while (b) { 
        if (b & 1)r = (r*t) % mod;
        b >>= 1;t = (t*t) % mod;
    }
    return r;
}
void init()
{
    fac[0] = 1;
    for (int i = 1;i <= mmax;i++) fac[i] = fac[i - 1] * 1ll * i%mod;
    inv[mmax] = qpow(fac[mmax], mod - 2);
    for (int i = mmax - 1;~i;i--) inv[i] = inv[i + 1] * 1ll * (i + 1) % mod;
}
ll C(ll n, ll m)
{
    if (m>n) return 0;
    if (m == n || m == 0) return 1;
    return fac[n] * 1ll * inv[n - m] % mod*inv[m] % mod;
}