#line 1 "verify/modint/UNIT_modint64.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/aplusb"
#line 2 "template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#line 2 "template/macro.hpp"
#define rep(i, a, b) for (int i = (a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b) - 1; i >= (a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
#define YN(b) cout << ((b) ? "YES" : "NO") << "\n";
#define Yn(b) cout << ((b) ? "Yes" : "No") << "\n";
#define yn(b) cout << ((b) ? "yes" : "no") << "\n";
#line 6 "template/template.hpp"
#line 2 "template/util.hpp"
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
template <class T>
using priority_queue_asc = priority_queue<T, vector<T>, greater<T>>;
template <class T, class S = T>
S SUM(const vector<T>& a) {
return accumulate(ALL(a), S(0));
}
template <class T1, class T2>
inline bool chmin(T1& a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmax(T1& a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmin_opt(optional<T1>& a, T2 b) {
if (!a || a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2>
inline bool chmax_opt(optional<T1>& a, T2 b) {
if (!a || a < b) {
a = b;
return true;
}
return false;
}
template <class T>
int popcnt(T x) {
return __builtin_popcountll(x);
}
template <class T>
int topbit(T x) {
return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <class T>
int lowbit(T x) {
return (x == 0 ? -1 : __builtin_ctzll(x));
}
#line 8 "template/template.hpp"
#line 2 "template/inout.hpp"
struct Fast {
Fast() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} fast;
ostream& operator<<(ostream& os, __uint128_t x) {
char buf[40];
size_t k = 0;
while (x > 0) buf[k++] = (char)(x % 10 + '0'), x /= 10;
if (k == 0) buf[k++] = '0';
while (k) os << buf[--k];
return os;
}
ostream& operator<<(ostream& os, __int128_t x) {
return x < 0 ? (os << '-' << (__uint128_t)(-x)) : (os << (__uint128_t)x);
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a);
template <class T1, class T2>
istream& operator>>(istream& is, pair<T1, T2>& p) {
return is >> p.first >> p.second;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const pair<T1, T2>& p) {
return os << p.first << " " << p.second;
}
template <class T>
istream& operator>>(istream& is, vector<T>& a) {
for (auto& v : a) is >> v;
return is;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& a) {
for (auto it = a.begin(); it != a.end();) {
os << *it;
if (++it != a.end()) os << " ";
}
return os;
}
template <class T, size_t N>
ostream& operator<<(ostream& os, const array<T, N>& a) {
for (auto it = a.begin(); it != a.end();) {
os << *it;
if (++it != a.end()) os << " ";
}
return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& st) {
os << "{";
for (auto it = st.begin(); it != st.end();) {
os << *it;
if (++it != st.end()) os << ",";
}
os << "}";
return os;
}
template <class T1, class T2>
ostream& operator<<(ostream& os, const map<T1, T2>& mp) {
os << "{";
for (auto it = mp.begin(); it != mp.end();) {
os << it->first << ":" << it->second;
if (++it != mp.end()) os << ",";
}
os << "}";
return os;
}
void in() {}
template <typename T, class... U>
void in(T& t, U&... u) {
cin >> t;
in(u...);
}
template <class... T>
void in_zip(int n, T&... t) {
assert(n >= 0 && ((size(t) >= static_cast<size_t>(n)) && ...));
for (int i = 0; i < n; i++) in(t[i]...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T& t, const U&... u) {
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
template <class T, class U>
void out_opt(const optional<T>& opt, const U& fallback, ostream& os = cout) {
if (opt.has_value())
os << opt.value();
else
os << fallback;
os << "\n";
}
template <class T, class U>
void out_opt(const vector<optional<T>>& vec, const U& fallback, ostream& os = cout) {
for (auto it = vec.begin(); it != vec.end();) {
if ((*it).has_value())
os << (*it).value();
else
os << fallback;
if (++it != vec.end()) os << " ";
}
os << "\n";
}
namespace IO {
template <class T, class... U>
T read(U&&... u) {
T t = T(forward<U>(u)...);
in(t);
return t;
}
namespace Graph {
vector<vector<int>> unweighted(int n, int m, bool directed = false, int offset = 1) {
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u -= offset, v -= offset;
g[u].push_back(v);
if (!directed) g[v].push_back(u);
}
return g;
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, int m, bool directed = false, int offset = 1) {
vector<vector<pair<int, T>>> g(n);
for (int i = 0; i < m; i++) {
int u, v;
T w;
cin >> u >> v >> w;
u -= offset, v -= offset;
g[u].push_back({v, w});
if (!directed) g[v].push_back({u, w});
}
return g;
}
} // namespace Graph
namespace Tree {
vector<vector<int>> unweighted(int n, bool directed = false, int offset = 1) {
return Graph::unweighted(n, n - 1, directed, offset);
}
template <class T>
vector<vector<pair<int, T>>> weighted(int n, bool directed = false, int offset = 1) {
return Graph::weighted<T>(n, n - 1, directed, offset);
}
vector<vector<int>> rooted(int n, bool to_root = true, bool to_leaf = true, int offset = 1) {
vector<vector<int>> g(n);
for (int i = 1; i < n; i++) {
int p;
cin >> p;
p -= offset;
if (to_root) g[i].push_back(p);
if (to_leaf) g[p].push_back(i);
}
return g;
}
} // namespace Tree
} // namespace IO
#line 10 "template/template.hpp"
#line 2 "template/debug.hpp"
#ifdef LOCAL
#define debug 1
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define debug 0
#define show(...) true
#endif
template <class T>
void _show(int, T) {
cerr << '\n';
}
template <class T1, class T2, class... T3>
void _show(int i, const T1& a, const T2& b, const T3&... c) {
for (; a[i] != ',' && a[i] != '\0'; i++) cerr << a[i];
cerr << ":" << b << " ";
_show(i + 1, a, c...);
}
#line 2 "modint/modint64.hpp"
template <uint64_t m>
struct ModInt64 {
static_assert(m >= 1);
using mint = ModInt64;
using u64 = uint64_t;
using u128 = __uint128_t;
using i128 = __int128_t;
public:
static constexpr u64 get_mod() { return m; }
static mint raw(u64 v) {
mint x;
x._v = v;
return x;
}
ModInt64() : _v(0) {}
template <class T, enable_if_t<is_integral_v<T> && is_signed_v<T>, int> = 0>
ModInt64(T v) {
if (v >= 0) {
_v = u128(v) % m;
} else {
using U = make_unsigned_t<T>;
U x = U(-(v + 1)) + 1;
u64 r = u128(x) % m;
_v = r == 0 ? 0 : m - r;
}
}
template <class T, enable_if_t<is_integral_v<T> && is_unsigned_v<T>, int> = 0>
ModInt64(T v) : _v(u128(v) % m) {}
u64 val() const { return _v; }
mint& operator++() {
_v++;
if (_v == m) _v = 0;
return *this;
}
mint& operator--() {
if (_v == 0) _v = m;
_v--;
return *this;
}
mint operator++(int) {
mint result = *this;
++*this;
return result;
}
mint operator--(int) {
mint result = *this;
--*this;
return result;
}
mint& operator+=(const mint& rhs) {
u64 x = _v + rhs._v;
if (x < _v || x >= m) x -= m;
_v = x;
return *this;
}
mint& operator-=(const mint& rhs) {
_v = _v >= rhs._v ? _v - rhs._v : m - (rhs._v - _v);
return *this;
}
mint& operator*=(const mint& rhs) {
_v = u128(_v) * rhs._v % m;
return *this;
}
mint& operator/=(const mint& rhs) { return *this *= rhs.inv(); }
mint operator+() const { return *this; }
mint operator-() const { return mint() - *this; }
mint pow(long long n) const {
assert(0 <= n);
mint x = *this, r = 1;
while (n) {
if (n & 1) r *= x;
x *= x;
n >>= 1;
}
return r;
}
mint inv() const {
u64 a = m, b = _v;
i128 x0 = 0, x1 = 1;
while (b) {
u64 q = a / b;
u64 r = a - q * b;
a = b;
b = r;
i128 x = x0 - i128(q) * x1;
x0 = x1;
x1 = x;
}
if (x0 < 0) x0 += m / a;
return raw(u64(x0));
}
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; }
friend bool operator==(const mint& lhs, const mint& rhs) { return lhs._v == rhs._v; }
friend bool operator!=(const mint& lhs, const mint& rhs) { return lhs._v != rhs._v; }
friend istream& operator>>(istream& is, mint& x) {
string s;
if (!(is >> s)) return is;
bool neg = s[0] == '-';
bool sign = neg || s[0] == '+';
u64 v = 0;
for (int i = sign; i < int(s.size()); i++) v = (u128(v) * 10 + (s[i] - '0')) % m;
x = raw(neg && v ? m - v : v);
return is;
}
friend ostream& operator<<(ostream& os, const mint& x) { return os << x.val(); }
private:
u64 _v;
};
#line 5 "verify/modint/UNIT_modint64.test.cpp"
template <uint64_t mod>
void test() {
using mint = ModInt64<mod>;
assert(mint::get_mod() == mod);
assert(mint(0).val() == 0);
assert(mint(-1).val() == mod - 1);
assert(mint(numeric_limits<long long>::min()).val() ==
uint64_t((__uint128_t(mod) - (__uint128_t(1) << 63) % mod) % mod));
assert(mint(numeric_limits<uint64_t>::max()).val() ==
numeric_limits<uint64_t>::max() % mod);
mint hi = mint::raw(mod - 1);
assert((hi + hi).val() == uint64_t((__uint128_t(mod - 1) * 2) % mod));
assert((mint(0) - hi).val() == uint64_t(1 % mod));
assert((hi * hi).val() == uint64_t(__uint128_t(mod - 1) * (mod - 1) % mod));
uint64_t a = 314 % mod, b = 271 % mod;
rep(i, 0, 200) {
mint x = mint::raw(a), y = mint::raw(b);
assert((x + y).val() == uint64_t((__uint128_t(a) + b) % mod));
assert((x - y).val() == uint64_t((__uint128_t(a) + mod - b) % mod));
assert((x * y).val() == uint64_t(__uint128_t(a) * b % mod));
if (gcd(b, mod) == 1) assert((x / y) * y == x);
mint z = 1;
rep(j, 0, 100) {
assert(z == x.pow(j));
z *= x;
}
a = (__uint128_t(a) * 159 + 265) % mod;
b = (__uint128_t(b) * 828 + 182) % mod;
}
mint x = mint::raw(mod - 1);
assert((++x).val() == 0);
assert((--x).val() == mod - 1);
}
int main() {
test<1>();
test<2>();
test<3>();
test<1000000000000000000ULL>();
test<18446744073709551557ULL>();
test<18446744073709551615ULL>();
using mint = ModInt64<1000000000000000003ULL>;
stringstream ss("18446744073709551615 -18446744073709551615 +1000000000000000004");
mint x, y, z;
ss >> x >> y >> z;
assert(x.val() == 446744073709551561ULL);
assert(y.val() == 553255926290448442ULL);
assert(z.val() == 1);
stringstream os;
os << x;
assert(os.str() == "446744073709551561");
int a, b;
in(a, b);
out(a + b);
}
verify/modint/UNIT_modint64.test.cpp
template/debug.hpp