type/modint.hpp

• View this file on GitHub
• Last update: 2023-07-16 21:56:51+09:00
• Include: #include "type/modint.hpp"

Required by

• Math/ManhattanSquareSum.hpp

Verified with

• test/AOJ_2863.test.cpp
• test/AOJ_DPL_5_A.test.cpp
• test/AOJ_DPL_5_B.test.cpp
• test/AOJ_DPL_5_C.test.cpp
• test/AOJ_DPL_5_D.test.cpp
• test/AOJ_DPL_5_E.test.cpp
• test/AOJ_DPL_5_F.test.cpp
• test/AOJ_DPL_5_G.test.cpp
• test/AOJ_DPL_5_H.test.cpp
• test/AOJ_DPL_5_I.test.cpp
• test/AOJ_DPL_5_J.test.cpp
• test/AOJ_DPL_5_K.test.cpp
• test/AOJ_DPL_5_L.test.cpp
• test/yosupo_Bitwise_And_Convolution.test.cpp
• test/yosupo_Bitwise_Xor_Convolution.test.cpp
• test/yosupo_Dynamic-Sequence-Range-Affine-Range-Sum.test.cpp
• test/yosupo_det.test.cpp
• test/yuki1917.test.cpp
• test/yuki2017.test.cpp
• test/yuki3784.test.cpp
• test/yuki473.test.cpp
• test/yuki5125.test.cpp
• test/yuki5436.test.cpp

Code

template<int Mod>
struct ModInt{
    int x;
    ModInt():x(0){}
    ModInt(int y): x (y >= 0 ? y % Mod : (Mod - (-y) % Mod) % Mod){}
    ModInt(long long y){
        if (y >= 0)
        {
            x = (int)(y % (ll)(Mod));
        }
        else
        {
            int tmp = (int)((-y) % (ll)Mod);
            x = (Mod - tmp) % Mod;
        }
    }
    ModInt &operator+=(const ModInt &p){
        if((x += p.x) >= Mod) x -= Mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x += Mod - p.x) >= Mod) x -= Mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x = (int)(1ll * x * p.x % Mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        (*this) *= p.inverse();
        return *this;
    }
    ModInt operator-()const{return ModInt(-x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
    bool operator==(const ModInt &p)const{return x==p.x;}
    bool operator!=(const ModInt &p)const{return x!=p.x;}
    ModInt inverse()const{
        int a = x, b = Mod ,u = 1, v = 0, t;
        while(b>0){
            t=a/b;
            swap(a-=t*b,b);swap(u-=t*v,v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n)const{
        ModInt ret(1),mul(x);
        while(n>0){
            if(n&1) ret*=mul;
            mul*=mul;n>>=1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
    friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
    static int get_mod(){return Mod;}
};

#line 1 "type/modint.hpp"
template<int Mod>
struct ModInt{
    int x;
    ModInt():x(0){}
    ModInt(int y): x (y >= 0 ? y % Mod : (Mod - (-y) % Mod) % Mod){}
    ModInt(long long y){
        if (y >= 0)
        {
            x = (int)(y % (ll)(Mod));
        }
        else
        {
            int tmp = (int)((-y) % (ll)Mod);
            x = (Mod - tmp) % Mod;
        }
    }
    ModInt &operator+=(const ModInt &p){
        if((x += p.x) >= Mod) x -= Mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p){
        if((x += Mod - p.x) >= Mod) x -= Mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p){
        x = (int)(1ll * x * p.x % Mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p){
        (*this) *= p.inverse();
        return *this;
    }
    ModInt operator-()const{return ModInt(-x);}
    ModInt operator+(const ModInt &p)const{return ModInt(*this)+=p;}
    ModInt operator-(const ModInt &p)const{return ModInt(*this)-=p;}
    ModInt operator*(const ModInt &p)const{return ModInt(*this)*=p;}
    ModInt operator/(const ModInt &p)const{return ModInt(*this)/=p;}
    bool operator==(const ModInt &p)const{return x==p.x;}
    bool operator!=(const ModInt &p)const{return x!=p.x;}
    ModInt inverse()const{
        int a = x, b = Mod ,u = 1, v = 0, t;
        while(b>0){
            t=a/b;
            swap(a-=t*b,b);swap(u-=t*v,v);
        }
        return ModInt(u);
    }
    ModInt pow(long long n)const{
        ModInt ret(1),mul(x);
        while(n>0){
            if(n&1) ret*=mul;
            mul*=mul;n>>=1;
        }
        return ret;
    }
    friend ostream &operator<<(ostream &os,const ModInt &p){return os<<p.x;}
    friend istream &operator>>(istream &is,ModInt &a){long long t;is>>t;a=ModInt<Mod>(t);return (is);}
    static int get_mod(){return Mod;}
};

Back to top page