数学--组合数学--当C(n,m)中n固定m++的递推模板

ll power(ll a, ll b, ll p)
{
    ll ans = 1 % p;
    for (; b; b >>= 1)
    {
        if (b & 1)
            ans = ans * a % p;
        a = a * a % p;
    }
    return ans;
}
long long   mm[500000];
void init(ll n, ll k)
{
    mm[1] = 1;
    for (ll i =2; i <= n; i++)
    {
        mm[i] = ((mm[i - 1] * (k + i - 2)) % MOD * power(i - 1, MOD - 2, MOD)) % MOD;
       //cout<<mm[i]<<endl;
    }
}