-
Notifications
You must be signed in to change notification settings - Fork 1
/
dynamic_modint.hpp
76 lines (71 loc) · 1.61 KB
/
dynamic_modint.hpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
#pragma once
#include"../template/template.hpp"
namespace lib {
template <int id> struct dynamic_modint {
using mint = dynamic_modint;
ll a;
static ll m;
dynamic_modint (ll x = 0) : a((x % m + m) % m) {}
static ll mod() {
return m;
}
static void set_mod(ll mod){
assert(1 <= mod);
m = mod;
}
ll& val() {
return a;
}
mint pow(ll n) {
mint res = 1;
mint x = a;
while (n) {
if (n & 1) res *= x;
x *= x;
n >>= 1;
}
return res;
}
mint inv() {
return pow(m - 2);
}
mint& operator+=(const mint rhs) {
a += rhs.a;
if (a >= m) a -= m;
return *this;
}
mint& operator-=(const mint rhs) {
if (a < rhs.a) a += m;
a -= rhs.a;
return *this;
}
mint& operator*=(const mint rhs) {
a = a * rhs.a % m;
return *this;
}
mint& operator/=(mint rhs) {
*this *= rhs.inv();
return *this;
}
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;
}
mint operator+() const {
return *this;
}
mint operator-() const {
return mint() - *this;
}
};
template<int id>
ll dynamic_modint<id>::m = 2;
} // namespace lib