zoukankan      html  css  js  c++  java
  • 乘法逆元(递推)

    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<cstdlib>
    #include<cmath>
    #include<algorithm>
    #define ll long long
    using namespace std;
    ll n,p,a[3000001];
    int main()
    {
        scanf("%lld%lld",&n,&p);
        a[1]=1;
        printf("%lld
    ",a[1]);
        for(int i=2;i<=n;i++)
        {
            a[i]=-(p/i)*a[p%i];
            a[i]=(a[i]%p+p)%p;
            printf("%lld
    ",a[i]);
        }
        return 0;
    }
  • 相关阅读:
    luogu 2617
    BZOJ 3295
    BZOJ 2458
    luogu 3810
    Uva
    Uva
    Uva
    Uva
    Uva
    成员函数的const到底修饰的是谁
  • 原文地址:https://www.cnblogs.com/water-radish/p/9280543.html
Copyright © 2011-2022 走看看