#pragma once
#include "../../math/iroot/sqrt/lib.hpp"
#include "../../math/qpow/mod/lib.hpp"
#include "../../nt/crt/basic/lib.hpp"
#include "../seq/invseq/lib.hpp"
namespace tifa_libs {
// Calculate $\binom{m}{n} \bmod p$, p can be ANY INTEGER
class exlucas {
struct TIFA {
cu32 p, q;
const bool no_proot;
u64 m_;
vecuu facp, ifacp;
CEXP TIFA(u32 p, u32 q) NE : p(p), q(q), no_proot(p == 2 && q >= 3) {
assert(p <= 100'000'000 && q > 0), m_ = 1;
while (q--) (m_ *= p), assert(m_ <= 100'000'000);
facp.resize(m_), facp[0] = facp[1] = 1;
flt_ (u64, i, 2, m_)
if (i % p == 0) facp[i] = facp[i - 1], facp[i + 1] = facp[i - 1] * (i + 1) % m_, ++i;
else facp[i] = facp[i - 1] * i % m_;
ifacp = gen_invseq(facp, m_);
}
CEXP u64 operator()(i64 m, i64 n) CNE {
retif_((m < n || n < 0) [[unlikely]], 0);
i64 r = m - n;
i32 e0 = 0, eq = 0;
u32 i = 0;
u64 res = 1;
while (m) {
res = res * facp[(u64)m % m_] % m_ * ifacp[(u64)n % m_] % m_ * ifacp[(u64)r % m_] % m_, m /= p, n /= p, r /= p;
if (ci32 eps = (i32)(m - n - r); (e0 += eps) >= (i32)q) return 0;
else if (++i >= q) eq += eps;
}
cu64 _ = (!no_proot && (eq & 1) ? m_ - res : res) * qpow_mod(p, (u32)e0, m_) % m_;
return _;
}
};
cu32 m_;
vecuu ms;
vec<TIFA> cs;
public:
CEXPE exlucas(u32 md) NE : m_(md) {
assert(md < 100'000'000);
flt_ (u32, i, 2, isqrt(md) + 1)
if (md % i == 0) {
u32 j = 0, k = 1;
while (md % i == 0) md /= i, ++j, k *= i;
ms.push_back(k), cs.emplace_back(i, j);
}
if (md > 1) ms.push_back(md), cs.emplace_back(md, 1);
}
CEXP u64 operator()(i64 m, i64 n) CNE {
retif_((m_ == 1 || m < n || n < 0) [[unlikely]], 0);
vecii b;
for (b.reserve(cs.size()); auto CR i : cs) b.push_back((i64)i(m, n));
return crt(b, ms)->first;
}
};
} // namespace tifa_libs
#line 2 "src/comb/exlucas/lib.hpp"
#line 2 "src/math/iroot/sqrt/lib.hpp"
#line 2 "src/util/alias/others/lib.hpp"
#line 2 "src/util/consts/lib.hpp"
#line 2 "src/util/alias/num/lib.hpp"
#line 2 "src/util/util/lib.hpp"
// https://github.com/Tiphereth-A/CP-lib
#include <bits/extc++.h>
// clang-format off
namespace tifa_libs {
#define CEXP constexpr
#define CEXPE constexpr explicit
#define CR const&
#define CP const*
#define PC *const
#define CPC const*const
#define TPN typename
#define NE noexcept
#define CNE const noexcept
#define ND [[nodiscard]]
#define cT_(...) std::conditional_t<sizeof(__VA_ARGS__) <= sizeof(size_t) * 2, __VA_ARGS__, __VA_ARGS__ CR>
// NOLINTNEXTLINE(misc-const-correctness)
#define flt_(T, i, l, r, ...) for (T i = (l), i##e = (r)__VA_OPT__(, ) __VA_ARGS__; i < i##e; ++i)
#define retif_(cond, if_true, ...) if cond return if_true __VA_OPT__(; else return __VA_ARGS__)
#ifdef ONLINE_JUDGE
#undef assert
#define assert(x) 42
#endif
using namespace std::ranges;
using namespace std::literals;
template <class T>
CEXP T abs(T x) NE { retif_((x < 0), -x, x); }
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/alias/num/lib.hpp"
// clang-format off
namespace tifa_libs {
#define mk0_(w, t) using w = t; using c##w = const t
#define mk_(w, t) mk0_(w, t); CEXP w operator""_##w(unsigned long long x) NE { return (w)x; }
mk_(i8, int8_t) mk_(u8, uint8_t) mk_(i16, int16_t) mk_(u16, uint16_t) mk_(i32, int32_t) mk_(u32, uint32_t) mk_(i64, int64_t) mk_(u64, uint64_t) mk_(isz, ssize_t) mk_(usz, size_t) mk_(chr, char) mk_(schr, signed char) mk_(uchr, unsigned char) mk_(sint, signed) mk_(uint, unsigned);
mk0_(i128, __int128_t); mk0_(u128, __uint128_t); mk0_(f32, float); mk0_(f64, double); mk0_(f128, long double);
#undef mk0_
#undef mk_
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/consts/lib.hpp"
// clang-format off
namespace tifa_libs {
using std::numbers::pi_v;
template <std::floating_point FP>
inline FP eps_v = std::sqrt(std::numeric_limits<FP>::epsilon());
template <std::floating_point FP>
CEXP void set_eps(FP v) NE { eps_v<FP> = v; }
CEXP u32 TIME = ((__TIME__[0] & 15) << 20) | ((__TIME__[1] & 15) << 16) | ((__TIME__[3] & 15) << 12) | ((__TIME__[4] & 15) << 8) | ((__TIME__[6] & 15) << 4) | (__TIME__[7] & 15);
CEXP auto STR2U16 = [] { std::array<u32, 65536> table{}; table.fill(-1_u32); flt_ (u32, i, 48, 58) flt_ (u32, j, 48, 58) table[i << 8 | j] = (j & 15) * 10 + (i & 15); return table; }();
inline const auto fn_0 = [](auto&&...) NE {};
inline const auto fn_is0 = [](auto x) NE { return x == 0; };
} // namespace tifa_libs
// clang-format on
#line 4 "src/util/alias/others/lib.hpp"
namespace tifa_libs {
template <class T>
struct chash {
CEXP static u64 C = u64(pi_v<f128> * 2e18) | 71;
CEXP u64 operator()(T x) CNE { return __builtin_bswap64(((u64)x ^ TIME) * C); }
};
// clang-format off
#define mk_(w, t) using w = t; using c##w = const t;
mk_(strn, std::string) mk_(strnv, std::string_view)
#undef mk_
template <class T> struct edge_t { T w; u32 u, v; CEXP auto operator<=>(edge_t CR) const = default; }; template <class T> using cedge_t = const edge_t<T>;
template <class T> struct pt3 { T _0, _1, _2; CEXP auto operator<=>(pt3 CR) const = default; }; template <class T> using cpt3 = const pt3<T>;
template <class T> struct pt4 { T _0, _1, _2, _3; CEXP auto operator<=>(pt4 CR) const = default; }; template <class T> using cpt4 = const pt4<T>;
#define mkT_(w, t, ...) template <class T> using w = t __VA_OPT__(, ) __VA_ARGS__; template <class T> using c##w = const t __VA_OPT__(, ) __VA_ARGS__;
mkT_(ptt, std::pair<T, T>) mkT_(alc, std::pmr::polymorphic_allocator<T>) mkT_(vec, std::vector<T>) mkT_(vvec, vec<vec<T>>) mkT_(v3ec, vvec<vec<T>>) mkT_(vecpt, vec<ptt<T>>) mkT_(vvecpt, vvec<ptt<T>>) mkT_(ptvec, ptt<vec<T>>) mkT_(ptvvec, ptt<vvec<T>>)
#undef mkT_
template <class T> using itl = std ::initializer_list<T>;
template <class T, usz ext = std::dynamic_extent> using spn = std::span<T const, ext>;
template <class T, usz N> using arr = std::array<T, N>; template <class T, usz N> using carr = std::array<const T, N>;
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 U, class T> using vvecp = vvec<std::pair<U, T>>; template <class U, class T> using vvvecp = vvec<vvec<std::pair<U, T>>>;
#ifdef PB_DS_ASSOC_CNTNR_HPP
template <class T, class C = std::less<T>> using set = __gnu_pbds::tree<T, __gnu_pbds::null_type, C>;
template <class K, class V, class C = std::less<K>> using map = __gnu_pbds::tree<K, V, C>;
// hset<u64> s({}, {}, {}, {}, {1<<16});
template <class T, class HF = chash<T>> using hset = __gnu_pbds::gp_hash_table<T, __gnu_pbds::null_type, HF>;
// hmap<u64, int> s({}, {}, {}, {}, {1<<16});
template <class K, class V, class HF = chash<K>> using hmap = __gnu_pbds::gp_hash_table<K, V, HF>;
#else
using std::set, std::map;
template <class T, class HF = chash<T>> using hset = std::unordered_set<T, HF>;
template <class K, class V, class HF = chash<K>> using hmap = std::unordered_map<K, V, HF>;
#endif
#ifdef PB_DS_PRIORITY_QUEUE_HPP
template <class T, class C = std::less<T>> using pq = __gnu_pbds::priority_queue<T, C>;
#else
template <class T, class C = std::less<T>> using pq = std::priority_queue<T, vec<T>, C>;
#endif
template <class T> using pqg = pq<T, std::greater<T>>;
// clang-format on
#define mk1_(V, A, T) using V##A = V<T>;
#define mk_(V, A, T) mk1_(V, A, T) mk1_(c##V, A, T)
#define mk(A, T) mk_(edge_t, A, T) mk_(ptt, A, T) mk_(pt3, A, T) mk_(pt4, A, T) mk_(vec, A, T) mk_(vvec, A, T) mk_(v3ec, A, T) mk_(vecpt, A, T) mk_(vvecpt, A, T) mk_(ptvec, A, T) mk_(ptvvec, A, T) mk1_(spn, A, T) mk1_(itl, A, T)
mk(b, bool) mk(c, chr) mk(i, i32) mk(u, u32) mk(ii, i64) mk(uu, u64) mk(t, isz) mk(z, usz) mk(f, f32) mk(d, f64) mk(s, strn);
#undef mk
#undef mk_
#undef mk1_
} // namespace tifa_libs
#line 4 "src/math/iroot/sqrt/lib.hpp"
namespace tifa_libs {
CEXP u32 isqrt(u64 x) NE {
retif_((!x) [[unlikely]], 0);
#pragma GCC diagnostic ignored "-Wconversion"
csint sh = 31 - (std::bit_width(x) - 1) / 2;
#pragma GCC diagnostic warning "-Wconversion"
u32 u = [](u64 x) NE {
CEXP arr<u8, 192> TAB{128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 144, 145, 146, 147, 148, 149, 150, 151, 151, 152, 153, 154, 155, 156, 156, 157, 158, 159, 160, 160, 161, 162, 163, 164, 164, 165, 166, 167, 167, 168, 169, 170, 170, 171, 172, 173, 173, 174, 175, 176, 176, 177, 178, 179, 179, 180, 181, 181, 182, 183, 183, 184, 185, 186, 186, 187, 188, 188, 189, 190, 190, 191, 192, 192, 193, 194, 194, 195, 196, 196, 197, 198, 198, 199, 200, 200, 201, 201, 202, 203, 203, 204, 205, 205, 206, 206, 207, 208, 208, 209, 210, 210, 211, 211, 212, 213, 213, 214, 214, 215, 216, 216, 217, 217, 218, 219, 219, 220, 220, 221, 221, 222, 223, 223, 224, 224, 225, 225, 226, 227, 227, 228, 228, 229, 229, 230, 230, 231, 232, 232, 233, 233, 234, 234, 235, 235, 236, 237, 237, 238, 238, 239, 239, 240, 240, 241, 241, 242, 242, 243, 243, 244, 244, 245, 246, 246, 247, 247, 248, 248, 249, 249, 250, 250, 251, 251, 252, 252, 253, 253, 254, 254, 255, 255, 255};
u32 u = TAB[(x >> 56) - 64];
u = (u << 7) + (u32)(x >> 41) / u;
return (u << 15) + (u32)((x >> 17) / u);
}(x << 2 * sh);
u >>= sh, u -= (u64)u * u > x;
return u;
}
} // namespace tifa_libs
#line 2 "src/math/qpow/mod/lib.hpp"
#line 2 "src/math/mul_mod/lib.hpp"
#line 2 "src/math/safe_mod/lib.hpp"
#line 2 "src/util/traits/math/lib.hpp"
// clang-format off
#line 4 "src/util/traits/math/lib.hpp"
namespace tifa_libs {
template <class T> concept char_c = std::same_as<T, char> || std::same_as<T, signed char> || std::same_as<T, unsigned char>;
#pragma GCC diagnostic ignored "-Wpedantic"
template <class T> concept s128_c = std::same_as<T, __int128_t> || std::same_as<T, __int128>;
template <class T> concept u128_c = std::same_as<T, __uint128_t> || std::same_as<T, unsigned __int128>;
template <class T> concept i128_c = s128_c<T> || u128_c<T>;
#pragma GCC diagnostic warning "-Wpedantic"
template <class T> concept imost64_c = std::integral<T> && sizeof(T) * __CHAR_BIT__ <= 64;
template <class T> concept smost64_c = imost64_c<T> && std::signed_integral<T>;
template <class T> concept umost64_c = imost64_c<T> && std::unsigned_integral<T>;
template <class T> concept int_c = i128_c<T> || imost64_c<T>;
template <class T> concept sint_c = s128_c<T> || smost64_c<T>;
template <class T> concept uint_c = u128_c<T> || umost64_c<T>;
template <class T> concept arithm_c = std::is_arithmetic_v<T> || int_c<T>;
template <class T> concept mint_c = requires(T x) { {x.mod()} -> uint_c; {x.val()} -> uint_c; };
template <class T> concept dft_c = requires(T x, std::vector<TPN T::data_t> v, u32 n) { {x.size()} -> std::same_as<u32>; x.bzr(n); x.dif(v, n); x.dit(v, n); };
template <class T> concept ntt_c = dft_c<T> && requires(T x) { T::max_size; T::G; };
template <class T> struct to_sint : std::make_signed<T> {};
template <> struct to_sint<u128> { using type = i128; };
template <> struct to_sint<i128> { using type = i128; };
template <class T> using to_sint_t = TPN to_sint<T>::type;
template <class T> struct to_uint : std::make_unsigned<T> {};
template <> struct to_uint<u128> { using type = u128; };
template <> struct to_uint<i128> { using type = u128; };
template <class T> using to_uint_t = TPN to_uint<T>::type;
template <arithm_c T> struct to_bigger : std::make_unsigned<T> {};
#define _(w,ww) template <> struct to_bigger<w> { using type = ww; }
#define _2(w,ww) _(i##w,i##ww); _(u##w,u##ww);
_2(8, 16); _2(16, 32); _2(32, 64); _2(64, 128); _(f32, f64); _(f64, f128);
#undef _2
#undef _
template <class T> using to_bigger_t = TPN to_bigger<T>::type;
template <arithm_c T> CEXP T inf_v = [] {
if CEXP(sint_c<T>) return T(to_uint_t<T>(-1) / 4 - 1);
else if CEXP(uint_c<T>) return T(-1) / 2 - 1;
else return std::numeric_limits<T>::max() / 2 - 1;
}();
} // namespace tifa_libs
// clang-format on
#line 4 "src/math/safe_mod/lib.hpp"
namespace tifa_libs {
template <int_c T>
CEXP T safe_mod(T x, to_uint_t<T> mod) NE {
if CEXP (sint_c<T>) {
if (x <= -(T)mod || x >= (T)mod) x %= (T)mod;
retif_((x < 0), x + (T)mod, x);
} else {
retif_((x >= mod), x % mod, x);
}
}
} // namespace tifa_libs
#line 4 "src/math/mul_mod/lib.hpp"
namespace tifa_libs {
CEXP i64 mul_mod_s(i64 a, i64 b, u64 mod) NE {
if (std::bit_width((u64)abs(a)) + std::bit_width((u64)abs(b)) < 64) return safe_mod(a * b % (i64)mod, mod);
return safe_mod((i64)((i128)a * b % mod), mod);
}
CEXP u64 mul_mod_u(u64 a, u64 b, u64 mod) NE {
if (std::bit_width(a) + std::bit_width(b) <= 64) return a * b % mod;
return (u64)((u128)a * b % mod);
}
} // namespace tifa_libs
#line 4 "src/math/qpow/mod/lib.hpp"
namespace tifa_libs {
CEXP u64 qpow_mod(u64 a, u64 b, u64 mod) NE {
u64 res(1);
for (a %= mod; b; b >>= 1, a = mul_mod_u(a, a, mod)) {
while (!(b & 1)) b >>= 1, a = mul_mod_u(a, a, mod);
res = mul_mod_u(res, a, mod);
}
return res;
}
} // namespace tifa_libs
#line 2 "src/nt/crt/basic/lib.hpp"
#line 2 "src/nt/gl/inv_gcd/lib.hpp"
#line 2 "src/nt/gl/exgcd/lib.hpp"
#line 4 "src/nt/gl/exgcd/lib.hpp"
namespace tifa_libs {
// Binary exgcd
template <uint_c U, bool only_x = false>
CEXP auto exgcd_b(U a, U b) NE {
using T = to_sint_t<U>;
if CEXP (only_x) {
if (!a) return std::make_tuple(b, (T)0);
if (!b) return std::make_tuple(a, (T)1);
} else {
if (!a) return std::make_tuple(b, (T)0, (T) !!b);
if (!b) return std::make_tuple(a, (T)1, (T)0);
}
auto r = std::__countr_zero(a | b);
a >>= r, b >>= r;
T x = (T)a, y = (T)b, s = 1, t = 0, u = 0, v = 1;
while (x) {
while (!(x & 1))
if (x /= 2; !((s | t) & 1)) s /= 2, t /= 2;
else s = (s + (T)b) / 2, t = (t - (T)a) / 2;
while (!(y & 1))
if (y /= 2; !((u | v) & 1)) u /= 2, v /= 2;
else u = (u + (T)b) / 2, v = (v - (T)a) / 2;
if (x >= y) x -= y, s -= u, t -= v;
else y -= x, u -= s, v -= t;
}
if (y > 1) a /= (U)y, b /= (U)y;
if (a && (U)abs(v) >= a) {
const T _ = v / (T)a;
v -= _ * (T)a, u += _ * (T)b;
}
if (b && (U)abs(u) >= b) {
const T _ = u / (T)b;
u -= _ * (T)b, v += _ * (T)a;
}
if (const T u_ = u + (T)b, v_ = v - (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
if (const T u_ = u - (T)b, v_ = v + (T)a; abs(u_) + abs(v_) <= abs(u) + abs(v)) u = u_, v = v_;
if CEXP (only_x) return std::make_tuple(U(y << r), u);
else return std::make_tuple(U(y << r), u, v);
}
// @return then return tuple(g, x[, y]) s.t. g = gcd(a, b), xa + yb = g, |x| + |y| is the minimal (primary) and x <= y (secondarily)
template <sint_c T, bool only_x = false>
CEXP auto exgcd(T a, T b) NE {
using U = to_uint_t<T>;
if (auto [x, y] = minmax(a, b); x >= 0 && y <= T(U(-1) >> sizeof(U))) return exgcd_b<U, only_x>((U)a, (U)b);
if CEXP (only_x) {
T s = 1, u = 0;
while (b) {
T c = a / b;
std::tie(s, u, a, b) = std::make_tuple(u, s - u * c, b, a - b * c);
}
return std::make_tuple((U)a, s);
} else {
T s = 1, t = 0, u = 0, v = 1;
while (b) {
T c = a / b;
std::tie(s, t, u, v, a, b) = std::make_tuple(u, v, s - u * c, t - v * c, b, a - b * c);
}
return std::make_tuple((U)a, s, t);
}
}
} // namespace tifa_libs
#line 6 "src/nt/gl/inv_gcd/lib.hpp"
namespace tifa_libs {
template <uint_c T>
CEXP ptt<T> inv_gcd(T n, T mod) NE {
using U = to_sint_t<T>;
auto [g, x] = exgcd<U, true>(U(n % mod), (U)mod);
return {g, safe_mod(x, mod)};
}
} // namespace tifa_libs
#line 5 "src/nt/crt/basic/lib.hpp"
namespace tifa_libs {
namespace crt_impl_ {
CEXP auto crt2(i64 a0, u64 m0, i64 a1, u64 m1) NE {
std::optional<pttii> ret;
if (m0 < m1) swap(a0, a1), swap(m0, m1);
auto [d, x] = inv_gcd(m0, m1);
ci64 a1_a0 = a1 - a0, a1_a0_d = a1_a0 / (i64)d;
if (a1_a0 != a1_a0_d * (i64)d) return ret;
ci64 m1_d = (i64)(m1 / d);
i64 k0 = (i64)x % m1_d * (a1_a0_d % m1_d) % m1_d;
if (k0 < 0) k0 += m1_d;
ret.emplace(a0 + k0 * (i64)m0, (i64)m0 * m1_d);
return ret;
}
} // namespace crt_impl_
// Returns (remainder, modular)
CEXP auto crt(spnii a, spnuu m) NE {
std::optional<pttuu> ret;
if (a.size() != m.size()) return ret;
ret.emplace(0, 1);
cu32 n = (u32)a.size();
flt_ (u32, i, 0, n)
if (ret = crt_impl_::crt2(safe_mod(a[i], m[i]), m[i], (i64)ret->first, ret->second); !ret) return ret;
return ret;
}
CEXP auto crt(spnuu a, spnuu m) NE {
vecii a_(a.size());
flt_ (u32, i, 0, (u32)a.size()) a_[i] = (i64)a[i];
return crt(a_, m);
}
} // namespace tifa_libs
#line 2 "src/comb/seq/invseq/lib.hpp"
#line 2 "src/nt/inverse/lib.hpp"
#line 4 "src/nt/inverse/lib.hpp"
namespace tifa_libs {
// simple but slower: inv(n, mod) -> 1 < n ? mod - inv(mod % n, n) * mod / n : 1;
template <uint_c T, uint_c U>
CEXP U inverse(T n, U mod) NE {
auto [g, x] = inv_gcd(U(n % mod), mod);
assert(g == 1);
return x;
}
} // namespace tifa_libs
#line 5 "src/comb/seq/invseq/lib.hpp"
namespace tifa_libs {
// i^{-1} for i in v
CEXP vecuu gen_invseq(spnuu v, u64 mod) NE {
cu32 n = (u32)v.size();
retif_((n == 0) [[unlikely]], {});
if (n == 1) return {inverse(v[0], mod)};
vecuu ans(n);
ans[0] = v[0];
flt_ (u32, i, 1, n) ans[i] = mul_mod_u(ans[i - 1], v[i], mod);
u64 _ = inverse(ans.back(), mod);
for (u32 i = n - 1; i; --i) ans[i] = mul_mod_u(_, ans[i - 1], mod), _ = mul_mod_u(_, v[i], mod);
ans[0] = _;
return ans;
}
// i^{-1} for i in v
template <class mint>
CEXP vec<mint> gen_invseq(vec<mint> CR v) NE {
u32 n = (u32)v.size();
vec<mint> ans(n);
vecuu v2(n);
flt_ (u32, i, 0, n) v2[i] = v[i].val();
auto _ = gen_invseq(v2, mint::mod());
flt_ (u32, i, 0, n) ans[i] = _[i];
return ans;
}
} // namespace tifa_libs
#line 7 "src/comb/exlucas/lib.hpp"
namespace tifa_libs {
// Calculate $\binom{m}{n} \bmod p$, p can be ANY INTEGER
class exlucas {
struct TIFA {
cu32 p, q;
const bool no_proot;
u64 m_;
vecuu facp, ifacp;
CEXP TIFA(u32 p, u32 q) NE : p(p), q(q), no_proot(p == 2 && q >= 3) {
assert(p <= 100'000'000 && q > 0), m_ = 1;
while (q--) (m_ *= p), assert(m_ <= 100'000'000);
facp.resize(m_), facp[0] = facp[1] = 1;
flt_ (u64, i, 2, m_)
if (i % p == 0) facp[i] = facp[i - 1], facp[i + 1] = facp[i - 1] * (i + 1) % m_, ++i;
else facp[i] = facp[i - 1] * i % m_;
ifacp = gen_invseq(facp, m_);
}
CEXP u64 operator()(i64 m, i64 n) CNE {
retif_((m < n || n < 0) [[unlikely]], 0);
i64 r = m - n;
i32 e0 = 0, eq = 0;
u32 i = 0;
u64 res = 1;
while (m) {
res = res * facp[(u64)m % m_] % m_ * ifacp[(u64)n % m_] % m_ * ifacp[(u64)r % m_] % m_, m /= p, n /= p, r /= p;
if (ci32 eps = (i32)(m - n - r); (e0 += eps) >= (i32)q) return 0;
else if (++i >= q) eq += eps;
}
cu64 _ = (!no_proot && (eq & 1) ? m_ - res : res) * qpow_mod(p, (u32)e0, m_) % m_;
return _;
}
};
cu32 m_;
vecuu ms;
vec<TIFA> cs;
public:
CEXPE exlucas(u32 md) NE : m_(md) {
assert(md < 100'000'000);
flt_ (u32, i, 2, isqrt(md) + 1)
if (md % i == 0) {
u32 j = 0, k = 1;
while (md % i == 0) md /= i, ++j, k *= i;
ms.push_back(k), cs.emplace_back(i, j);
}
if (md > 1) ms.push_back(md), cs.emplace_back(md, 1);
}
CEXP u64 operator()(i64 m, i64 n) CNE {
retif_((m_ == 1 || m < n || n < 0) [[unlikely]], 0);
vecii b;
for (b.reserve(cs.size()); auto CR i : cs) b.push_back((i64)i(m, n));
return crt(b, ms)->first;
}
};
} // namespace tifa_libs
src/comb/exlucas/lib.hpp