lucas【template】

Lucas(n,m,p)=c(n%p,m%p)*Lucas(n/p,m/p,p)
相关性质还在研究中，

template：

#include<iostream>#include<cstring>#include<cstdio>using namespace std;#define ll long long int//lucas 上限为p为1e5左右ll qkm_mod(ll a, ll b, ll p){    ll res = 1;    while (b)    {        if (b & 1)        {            res = res*a%p;        }        a*a;        b >>= 1;    }    return res;}ll comb(ll a, ll b, ll p){    if (a < b)        return 0;    if (a == b)        return 1;    if (b > a - b)        a - b;    ll ans = 1, ca = 1, cb = 1;    for (ll i = 0; i < b; i++)    {        ca = (ca*(a - i)) % p;        cb = (cb*(b - i)) % p;    }    ans = (ca*qkm_mod(cb, p - 2, p)) % p;    return ans;}ll lucas(ll n, ll m, ll p){    ll ans = 1;    while (n&&m&&ans)    {        ans = (ans*comb(n%p, m%p, p)) % p;        n /= p;        m /= p;    }    return ans;}int main(){    ll n, m, p;    while (~scanf("%lld%lld%lld", &n, &m, &p))    {        printf("%lld\n", lucas(n, m, p));    }    return 0;}