乘法逆元+扩展欧几里得+Lucas

最新推荐文章于 2022-12-19 23:32:55 发布

qq_34287501

最新推荐文章于 2022-12-19 23:32:55 发布

阅读量224

点赞数

分类专栏：模板（自用）文章标签： q_mod e_gcd Lucas

本文链接：https://blog.csdn.net/qq_34287501/article/details/77252476

版权

模板（自用）专栏收录该内容

17 篇文章 0 订阅

订阅专栏

代码：

void e_gcd(LL a, LL b, LL &x, LL &y)
{
    if(b == 0)
    {
        x = 1; y = 0;
        return ;
    }
    e_gcd(b, a % b, x, y);
    int tm = x; x = y;
    y = tm - a / b * y;
}

LL lucas(int n, int m, int p)
{
    LL ans = 1;
    while(m && n && ans)
    {
        ans = (ans * c_mn(n % p, m % p, p)) % p;
        m /= p;
        n /= p;
    }
    return ans;
}
LL c_mn(LL a, LL b, LL p)
{
    if(a < b)   return 0;
    if(a == b)  return 1;
    if(b > a - b)   b = a - b;
    LL ca, cb;
    ca = cb = 1;
    for(LL i = 0; i < b; i++)
    {
        ca = (ca * (a - i)) % p;
        cb = (cb * (b - i)) % p;
    }
    LL x, y;
    e_gcd(cb, p, x, y);
    x = ((x % p) + p) % p;
    LL ans = (ca * x) % p;
    return ans;
}