utility/dynamic_modint.hpp

• View this file on GitHub
• Last update: 2023-06-10 00:47:04+09:00
• Include: #include "utility/dynamic_modint.hpp"

Depends on

• テンプレート (template/template.hpp)

Verified with

• test/math/Binomial_Coefficient.test.cpp

Code

#pragma once

#include"../template/template.hpp"

namespace lib {

template <int id> struct dynamic_modint {
    using mint = dynamic_modint;
    ll a;
    static ll m;
    dynamic_modint (ll x = 0) : a((x % m + m) % m) {}
    static ll mod() {
        return m;
    }
    static void set_mod(ll mod){
        assert(1 <= mod);
        m = mod;
    }
    ll& val() {
        return a;
    }
    mint pow(ll n) {
        mint res = 1;
        mint x = a;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }
    mint inv() {
        return pow(m - 2);
    }
    mint& operator+=(const mint rhs) {
        a += rhs.a;
        if (a >= m) a -= m;
        return *this;
    }
    mint& operator-=(const mint rhs) {
        if (a < rhs.a) a += m;
        a -= rhs.a;
        return *this;
    }
    mint& operator*=(const mint rhs) {
        a = a * rhs.a % m;
        return *this;
    }
    mint& operator/=(mint rhs) {
        *this *= rhs.inv();
        return *this;
    }
    friend mint operator+(const mint& lhs, const mint& rhs) {
        return mint(lhs) += rhs;
    }
    friend mint operator-(const mint& lhs, const mint& rhs) {
        return mint(lhs) -= rhs;
    }
    friend mint operator*(const mint& lhs, const mint& rhs) {
        return mint(lhs) *= rhs;
    }
    friend mint operator/(const mint& lhs, const mint& rhs) {
        return mint(lhs) /= rhs;
    }
    mint operator+() const {
        return *this;
    }
    mint operator-() const {
        return mint() - *this;
    }
};

template<int id>
ll dynamic_modint<id>::m = 2;

} // namespace lib

#line 2 "utility/dynamic_modint.hpp"

#line 2 "template/template.hpp"

#include <bits/stdc++.h>

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <typename T> bool chmin(T &a, const T &b) {
    if (a <= b) return false;
    a = b;
    return true;
}
template <typename T> bool chmax(T &a, const T &b) {
    if (a >= b) return false;
    a = b;
    return true;
}

namespace lib {

using namespace std;

}  // namespace lib

// using namespace lib;
#line 4 "utility/dynamic_modint.hpp"

namespace lib {

template <int id> struct dynamic_modint {
    using mint = dynamic_modint;
    ll a;
    static ll m;
    dynamic_modint (ll x = 0) : a((x % m + m) % m) {}
    static ll mod() {
        return m;
    }
    static void set_mod(ll mod){
        assert(1 <= mod);
        m = mod;
    }
    ll& val() {
        return a;
    }
    mint pow(ll n) {
        mint res = 1;
        mint x = a;
        while (n) {
            if (n & 1) res *= x;
            x *= x;
            n >>= 1;
        }
        return res;
    }
    mint inv() {
        return pow(m - 2);
    }
    mint& operator+=(const mint rhs) {
        a += rhs.a;
        if (a >= m) a -= m;
        return *this;
    }
    mint& operator-=(const mint rhs) {
        if (a < rhs.a) a += m;
        a -= rhs.a;
        return *this;
    }
    mint& operator*=(const mint rhs) {
        a = a * rhs.a % m;
        return *this;
    }
    mint& operator/=(mint rhs) {
        *this *= rhs.inv();
        return *this;
    }
    friend mint operator+(const mint& lhs, const mint& rhs) {
        return mint(lhs) += rhs;
    }
    friend mint operator-(const mint& lhs, const mint& rhs) {
        return mint(lhs) -= rhs;
    }
    friend mint operator*(const mint& lhs, const mint& rhs) {
        return mint(lhs) *= rhs;
    }
    friend mint operator/(const mint& lhs, const mint& rhs) {
        return mint(lhs) /= rhs;
    }
    mint operator+() const {
        return *this;
    }
    mint operator-() const {
        return mint() - *this;
    }
};

template<int id>
ll dynamic_modint<id>::m = 2;

} // namespace lib

Back to top page