Mod int
(math/modint.hpp)

• View this file on GitHub
• Last update: 2024-01-07 20:09:47+09:00
• Include: #include "math/modint.hpp"

Required by

• Arbitrary Mod Convolution (convolution/arbitrary_mod_convolution.hpp)

Verified with

• test/yosupo/bernoulli_number.test.cpp
• test/yosupo/bitwise_and_convolution.test.cpp
• test/yosupo/bitwise_xor_convolution.test.cpp
• test/yosupo/characteristic_polynomial.test.cpp
• test/yosupo/convolution_mod.test.cpp
• test/yosupo/convolution_mod_1000000007.test.cpp
• test/yosupo/deque_operate_all_composite.test.cpp
• test/yosupo/division_of_polynomials.test.cpp
• test/yosupo/dynamic_sequence_range_affine_range_sum.treap.test.cpp
• test/yosupo/dynamic_tree_vertex_set_path_composite.test.cpp
• test/yosupo/enumerate_cliques.test.cpp
• test/yosupo/enumerate_triangles.test.cpp
• test/yosupo/exp_of_formal_power_series.test.cpp
• test/yosupo/exp_of_set_power_series.test.cpp
• test/yosupo/factorial.test.cpp
• test/yosupo/find_linear_recurrence.test.cpp
• test/yosupo/gcd_convolution.test.cpp
• test/yosupo/hafnian_of_matrix.test.cpp
• test/yosupo/inv_of_formal_power_series.test.cpp
• test/yosupo/inverse_matrix.test.cpp
• test/yosupo/kth_term_of_linearly_recurrent_sequence.test.cpp
• test/yosupo/lcm_convolution.test.cpp
• test/yosupo/log_of_formal_power_series.test.cpp
• test/yosupo/matrix_det.test.cpp
• test/yosupo/matrix_product.test.cpp
• test/yosupo/matrix_rank.test.cpp
• test/yosupo/multipoint_evaluation.test.cpp
• test/yosupo/number_of_subsequences.test.cpp
• test/yosupo/partition_function.test.cpp
• test/yosupo/point_set_range_composite.test.cpp
• test/yosupo/point_set_range_sort_range_composite.test.cpp
• test/yosupo/polynomial_interpolation.test.cpp
• test/yosupo/polynomial_taylor_shift.test.cpp
• test/yosupo/pow_of_formal_power_series.test.cpp
• test/yosupo/pow_of_matrix.test.cpp
• test/yosupo/product_of_polynomial_sequence.test.cpp
• test/yosupo/queue_operate_all_composite.test.cpp
• test/yosupo/range_affine_point_get.test.cpp
• test/yosupo/range_affine_range_sum.test.cpp
• test/yosupo/sharp_p_subset_sum.test.cpp
• test/yosupo/stirling_number_of_the_first_kind.test.cpp
• test/yosupo/stirling_number_of_the_second_kind.test.cpp
• test/yosupo/subset_convolution.test.cpp
• test/yosupo/sum_of_totient_function.test.cpp
• test/yosupo/system_of_linear_equations.test.cpp
• test/yosupo/tree_path_composite_sum.test.cpp
• test/yosupo/vertex_set_path_composite.test.cpp

Code

#pragma once
#include <algorithm>
#include <iostream>

/**
 * @brief Mod int
 */
template <int m>
class Modint {
    using mint = Modint;
    static_assert(m > 0, "Modulus must be positive");

   public:
    static constexpr int mod() { return m; }

    constexpr Modint(long long y = 0) : x(y >= 0 ? y % m : (y % m + m) % m) {}

    constexpr int val() const { return x; }

    constexpr mint& operator+=(const mint& r) {
        if ((x += r.x) >= m) x -= m;
        return *this;
    }
    constexpr mint& operator-=(const mint& r) {
        if ((x += m - r.x) >= m) x -= m;
        return *this;
    }
    constexpr mint& operator*=(const mint& r) {
        x = static_cast<int>(1LL * x * r.x % m);
        return *this;
    }
    constexpr mint& operator/=(const mint& r) { return *this *= r.inv(); }

    constexpr bool operator==(const mint& r) const { return x == r.x; }

    constexpr mint operator+() const { return *this; }
    constexpr mint operator-() const { return mint(-x); }

    constexpr friend mint operator+(const mint& l, const mint& r) {
        return mint(l) += r;
    }
    constexpr friend mint operator-(const mint& l, const mint& r) {
        return mint(l) -= r;
    }
    constexpr friend mint operator*(const mint& l, const mint& r) {
        return mint(l) *= r;
    }
    constexpr friend mint operator/(const mint& l, const mint& r) {
        return mint(l) /= r;
    }

    constexpr mint inv() const {
        int a = x, b = m, u = 1, v = 0;
        while (b > 0) {
            int t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return mint(u);
    }

    constexpr mint pow(long long n) const {
        mint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend std::ostream& operator<<(std::ostream& os, const mint& r) {
        return os << r.x;
    }

    friend std::istream& operator>>(std::istream& is, mint& r) {
        long long t;
        is >> t;
        r = mint(t);
        return is;
    }

   private:
    int x;
};

#line 2 "math/modint.hpp"
#include <algorithm>
#include <iostream>

/**
 * @brief Mod int
 */
template <int m>
class Modint {
    using mint = Modint;
    static_assert(m > 0, "Modulus must be positive");

   public:
    static constexpr int mod() { return m; }

    constexpr Modint(long long y = 0) : x(y >= 0 ? y % m : (y % m + m) % m) {}

    constexpr int val() const { return x; }

    constexpr mint& operator+=(const mint& r) {
        if ((x += r.x) >= m) x -= m;
        return *this;
    }
    constexpr mint& operator-=(const mint& r) {
        if ((x += m - r.x) >= m) x -= m;
        return *this;
    }
    constexpr mint& operator*=(const mint& r) {
        x = static_cast<int>(1LL * x * r.x % m);
        return *this;
    }
    constexpr mint& operator/=(const mint& r) { return *this *= r.inv(); }

    constexpr bool operator==(const mint& r) const { return x == r.x; }

    constexpr mint operator+() const { return *this; }
    constexpr mint operator-() const { return mint(-x); }

    constexpr friend mint operator+(const mint& l, const mint& r) {
        return mint(l) += r;
    }
    constexpr friend mint operator-(const mint& l, const mint& r) {
        return mint(l) -= r;
    }
    constexpr friend mint operator*(const mint& l, const mint& r) {
        return mint(l) *= r;
    }
    constexpr friend mint operator/(const mint& l, const mint& r) {
        return mint(l) /= r;
    }

    constexpr mint inv() const {
        int a = x, b = m, u = 1, v = 0;
        while (b > 0) {
            int t = a / b;
            std::swap(a -= t * b, b);
            std::swap(u -= t * v, v);
        }
        return mint(u);
    }

    constexpr mint pow(long long n) const {
        mint ret(1), mul(x);
        while (n > 0) {
            if (n & 1) ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    friend std::ostream& operator<<(std::ostream& os, const mint& r) {
        return os << r.x;
    }

    friend std::istream& operator>>(std::istream& is, mint& r) {
        long long t;
        is >> t;
        r = mint(t);
        return is;
    }

   private:
    int x;
};

Back to top page