modint/mont_arb.hpp

• View this file on GitHub
• Last update: 2025-06-04 11:53:52+09:00
• Include: #include "modint/mont_arb.hpp"

Depends on

• type_traits/integral.hpp
• type_traits/io.hpp

Required by

• fps/fps_sqrt.hpp
• math/group/rolling_hash.hpp
• math/is_prime.hpp
• math/multiplicative_function/euler_phi.hpp
• math/multiplicative_function/mobius.hpp
• math/multiplicative_function/sigma.hpp
• math/prime_factorize.hpp
• math_mod/mod_sqrt.hpp
• math_mod/primitive_root_64bit.hpp
• random/hash.hpp
• 文字の一点更新が可能文字列に対する動的なローリングハッシュ (string/dynamic_rolling_hash.hpp)
• 文字の変更が行われない文字列に対する静的なローリングハッシュ (string/static_rolling_hash.hpp)

Verified with

• verify/aoj/aoj_alds1_14_b.test.cpp
• verify/aoj/aoj_ntl_1_d.test.cpp
• verify/unit_test/famous_function_table.test.cpp
• verify/unit_test/isprime_table_extend.test.cpp
• verify/unit_test/lpf_table_extend.test.cpp
• verify/unit_test/monoid.test.cpp
• verify/unit_test/prime_factorize_table.test.cpp
• verify/yosupo_fps/fps_sprase_sqrt.test.cpp
• verify/yosupo_fps/fps_sqrt.test.cpp
• verify/yosupo_math/factrize.test.cpp
• verify/yosupo_math/primality_test.test.cpp
• verify/yosupo_math/primitive_root.test.cpp
• verify/yosupo_math/sqrt_mod.test.cpp
• verify/yosupo_string/string_z_roliha.test.cpp

Code

#ifndef KK2_MODINT_MONT_ARB_HPP
#define KK2_MODINT_MONT_ARB_HPP 1

#include <cassert>
#include <iostream>
#include <utility>

#include "../type_traits/integral.hpp"
#include "../type_traits/io.hpp"

namespace kk2 {

template <typename Int, typename UInt, typename Long, typename ULong, int id>
struct ArbitraryLazyMontgomeryModIntBase {
    using mint = ArbitraryLazyMontgomeryModIntBase;

    inline static UInt mod;
    inline static UInt r;
    inline static UInt n2;
    static constexpr int bit_length = sizeof(UInt) * 8;

    static UInt get_r() {
        UInt ret = mod;
        while (mod * ret != 1) ret *= UInt(2) - mod * ret;
        return ret;
    }

    static void setmod(UInt m) {
        assert(m < (UInt(1u) << (bit_length - 2)));
        assert(m & 1);
        mod = m, n2 = -ULong(m) % m, r = get_r();
    }

    UInt _v;

    ArbitraryLazyMontgomeryModIntBase() : _v(0) {}

    template <class T, is_integral_t<T> * = nullptr> ArbitraryLazyMontgomeryModIntBase(const T &b)
        : _v(reduce(ULong(b % (Int)mod + mod) * n2)) {}

    static UInt reduce(const ULong &b) {
        return (b + ULong(UInt(b) * UInt(-r)) * mod) >> bit_length;
    }

    mint &operator+=(const mint &b) {
        if (Int(_v += b._v - 2 * mod) < 0) _v += 2 * mod;
        return *this;
    }

    mint &operator-=(const mint &b) {
        if (Int(_v -= b._v) < 0) _v += 2 * mod;
        return *this;
    }

    mint &operator*=(const mint &b) {
        _v = reduce(ULong(_v) * b._v);
        return *this;
    }

    mint &operator/=(const mint &b) {
        *this *= b.inv();
        return *this;
    }

    mint operator-() const { return mint(0) - mint(*this); }
    mint operator+() const { return mint(*this); }
    friend mint operator+(const mint &a, const mint &b) { return mint(a) += b; }
    friend mint operator-(const mint &a, const mint &b) { return mint(a) -= b; }
    friend mint operator*(const mint &a, const mint &b) { return mint(a) *= b; }
    friend mint operator/(const mint &a, const mint &b) { return mint(a) /= b; }

    bool operator==(const mint &b) const {
        return (_v >= mod ? _v - mod : _v) == (b._v >= mod ? b._v - mod : b._v);
    }

    bool operator!=(const mint &b) const {
        return (_v >= mod ? _v - mod : _v) != (b._v >= mod ? b._v - mod : b._v);
    }

    template <class T> mint pow(T n) const {
        mint ret(1), mul(*this);
        n %= (Long)getmod() - 1;
        while (n > 0) {
            if (n & 1) ret *= mul;
            if (n >>= 1) mul *= mul;
        }
        return ret;
    }

    mint inv() const {
        Int s = getmod(), t = val(), m0 = 0, m1 = 1;
        while (t) {
            Int u = s / t;
            std::swap(s -= t * u, t);
            std::swap(m0 -= m1 * u, m1);
        }
        if (m0 < 0) m0 += getmod();
        return mint(m0);
    }

    template <class OStream, is_ostream_t<OStream> * = nullptr>
    friend OStream &operator<<(OStream &os, const mint &x) {
        return os << x.val();
    }

    template <class IStream, is_istream_t<IStream> * = nullptr>
    friend IStream &operator>>(IStream &is, mint &x) {
        Long t;
        is >> t;
        x = mint(t);
        return (is);
    }

    UInt val() const {
        UInt ret = reduce(_v);
        return ret >= mod ? ret - mod : ret;
    }

    static UInt getmod() { return mod; }
};

template <int id> using ArbitraryLazyMontgomeryModInt =
    ArbitraryLazyMontgomeryModIntBase<int, unsigned int, long long, unsigned long long, id>;

template <int id> using ArbitraryLazyMontgomeryModInt64bit =
    ArbitraryLazyMontgomeryModIntBase<long long, unsigned long long, __int128_t, __uint128_t, id>;

} // namespace kk2

#endif // KK2_MODINT_MONT_ARB_HPP

Traceback (most recent call last):
  File "/opt/hostedtoolcache/Python/3.12.0/x64/lib/python3.12/site-packages/onlinejudge_verify/documentation/build.py", line 71, in _render_source_code_stat
    bundled_code = language.bundle(stat.path, basedir=basedir, options={'include_paths': [basedir]}).decode()
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/opt/hostedtoolcache/Python/3.12.0/x64/lib/python3.12/site-packages/onlinejudge_verify/languages/cplusplus.py", line 187, in bundle
    bundler.update(path)
  File "/opt/hostedtoolcache/Python/3.12.0/x64/lib/python3.12/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 401, in update
    self.update(self._resolve(pathlib.Path(included), included_from=path))
  File "/opt/hostedtoolcache/Python/3.12.0/x64/lib/python3.12/site-packages/onlinejudge_verify/languages/cplusplus_bundle.py", line 312, in update
    raise BundleErrorAt(path, i + 1, "#pragma once found in a non-first line")
onlinejudge_verify.languages.cplusplus_bundle.BundleErrorAt: type_traits/integral.hpp: line 4: #pragma once found in a non-first line

Back to top page