Tifa's CP Library

:heavy_check_mark: rpow (src/code/math/rpow.hpp)

Depends on

Required by

Verified with

Code

#ifndef TIFALIBS_MATH_RPOW
#define TIFALIBS_MATH_RPOW

#include "mul_mod_u.hpp"

namespace tifa_libs::math {

class rpow {
  vecu64 b0, b1;
  u64 b_, m_;

 public:
  explicit constexpr rpow() : b0(65536), b1(65536), b_(), m_() {}
  constexpr rpow(u64 base_, u32 mod_) : rpow() { reset(base_, mod_); }

  constexpr void reset(u64 base, u32 mod) {
    if (b_ == base % mod && m_ == mod) return;
    b_ = base % mod;
    m_ = mod;
    b0[0] = b1[0] = 1;
    for (u32 i = 1; i < 65536; ++i) b0[i] = mul_mod_u(b0[i - 1], b_, m_);
    u64 _(mul_mod_u(b0.back(), b_, m_));
    for (u32 i = 1; i < 65536; ++i) b1[i] = mul_mod_u(b1[i - 1], _, m_);
  }

  constexpr void swap(rpow& r) {
    b0.swap(r.b0), b1.swap(r.b1);
    std::swap(b_, r.b_), std::swap(m_, r.m_);
  }

  constexpr u64 base() const { return b_; }
  constexpr u64 mod() const { return m_; }

  constexpr u64 operator()(u32 x) const { return mul_mod_u(b0[x & 65535], b1[x >> 16], m_); }
};

}  // namespace tifa_libs::math

#endif
#line 1 "src/code/math/rpow.hpp"



#line 1 "src/code/math/mul_mod_u.hpp"



#line 1 "src/code/util/util.hpp"



#include <bits/stdc++.h>

template <class T>
constexpr T abs(T x) { return x < 0 ? -x : x; }

using i8 = int8_t;
using i16 = int16_t;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;
using isz = ptrdiff_t;

using u8 = uint8_t;
using u16 = uint16_t;
using u32 = uint32_t;
using u64 = uint64_t;
using u128 = __uint128_t;
using usz = size_t;

using f32 = float;
using f64 = double;
using f128 = long double;

template <class T>
using ptt = std::pair<T, T>;
template <class T>
using pt3 = std::tuple<T, T, T>;
template <class T>
using pt4 = std::tuple<T, T, T, T>;

template <class T, usz N>
using arr = std::array<T, N>;
template <class T>
using vec = std::vector<T>;
template <class T>
using vvec = vec<vec<T>>;
template <class T>
using v3ec = vec<vvec<T>>;
template <class U, class T>
using vecp = vec<std::pair<U, T>>;
template <class U, class T>
using vvecp = vvec<std::pair<U, T>>;
template <class T>
using vecpt = vec<ptt<T>>;
template <class T>
using vvecpt = vvec<ptt<T>>;

template <class T, class C = std::less<T>>
using pq = std::priority_queue<T, vec<T>, C>;
template <class T>
using pqg = std::priority_queue<T, vec<T>, std::greater<T>>;

using strn = std::string;
using strnv = std::string_view;

using vecu = vec<u32>;
using vvecu = vvec<u32>;
using v3ecu = v3ec<u32>;
using vecu64 = vec<u64>;
using vecb = vec<bool>;
using vvecb = vvec<bool>;

#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif

using namespace std::literals;

constexpr i8 operator""_i8(unsigned long long x) { return (i8)x; }
constexpr i16 operator""_i16(unsigned long long x) { return (i16)x; }
constexpr i32 operator""_i32(unsigned long long x) { return (i32)x; }
constexpr i64 operator""_i64(unsigned long long x) { return (i64)x; }
constexpr isz operator""_iz(unsigned long long x) { return (isz)x; }

constexpr u8 operator""_u8(unsigned long long x) { return (u8)x; }
constexpr u16 operator""_u16(unsigned long long x) { return (u16)x; }
constexpr u32 operator""_u32(unsigned long long x) { return (u32)x; }
constexpr u64 operator""_u64(unsigned long long x) { return (u64)x; }
constexpr usz operator""_uz(unsigned long long x) { return (usz)x; }

inline const auto fn_0 = [](auto&&...) {};


#line 5 "src/code/math/mul_mod_u.hpp"

namespace tifa_libs::math {

constexpr u64 mul_mod_u(u64 a, u64 b, u64 mod) {
  if (std::bit_width(a) + std::bit_width(b) <= 64) return a * b % mod;
  else return (u64)((u128)a * b % mod);
}

}  // namespace tifa_libs::math


#line 5 "src/code/math/rpow.hpp"

namespace tifa_libs::math {

class rpow {
  vecu64 b0, b1;
  u64 b_, m_;

 public:
  explicit constexpr rpow() : b0(65536), b1(65536), b_(), m_() {}
  constexpr rpow(u64 base_, u32 mod_) : rpow() { reset(base_, mod_); }

  constexpr void reset(u64 base, u32 mod) {
    if (b_ == base % mod && m_ == mod) return;
    b_ = base % mod;
    m_ = mod;
    b0[0] = b1[0] = 1;
    for (u32 i = 1; i < 65536; ++i) b0[i] = mul_mod_u(b0[i - 1], b_, m_);
    u64 _(mul_mod_u(b0.back(), b_, m_));
    for (u32 i = 1; i < 65536; ++i) b1[i] = mul_mod_u(b1[i - 1], _, m_);
  }

  constexpr void swap(rpow& r) {
    b0.swap(r.b0), b1.swap(r.b1);
    std::swap(b_, r.b_), std::swap(m_, r.m_);
  }

  constexpr u64 base() const { return b_; }
  constexpr u64 mod() const { return m_; }

  constexpr u64 operator()(u32 x) const { return mul_mod_u(b0[x & 65535], b1[x >> 16], m_); }
};

}  // namespace tifa_libs::math


Back to top page