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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
//! modを動的に設定できるModint

use std::{
    fmt::{Debug, Display},
    ops::{Add, AddAssign, Div, DivAssign, Mul, MulAssign, Neg, Sub, SubAssign},
};

use crate::number_theory::ext_euclid::inv;

/// modを動的に設定できるModint
#[derive(Clone, Copy, Default, PartialEq, Eq, Hash, Debug)]
pub struct Modint2 {
    pub value: usize,
    pub m: usize,
}

impl Modint2 {
    pub fn new(x: usize, m: usize) -> Self {
        Self { value: x % m, m }
    }

    pub fn from_isize(x: isize, m: usize) -> Self {
        Self::new(x.rem_euclid(m as isize) as usize, m)
    }
}

impl Neg for Modint2 {
    type Output = Self;
    fn neg(self) -> Self {
        Modint2::new(
            if self.value == 0 {
                0
            } else {
                self.m - self.value
            },
            self.m,
        )
    }
}

impl Add for Modint2 {
    type Output = Self;
    fn add(self, rhs: Self) -> Self {
        assert!(self.m == rhs.m);
        let mut res = self.value + rhs.value;
        if res >= self.m {
            res -= self.m;
        }
        Modint2::new(res, self.m)
    }
}

impl Sub for Modint2 {
    type Output = Self;
    fn sub(self, rhs: Self) -> Self {
        assert!(self.m == rhs.m);
        self + (-rhs)
    }
}

impl Mul for Modint2 {
    type Output = Self;
    fn mul(self, rhs: Self) -> Self {
        assert!(self.m == rhs.m);
        Modint2::new(self.value * rhs.value % self.m, self.m)
    }
}

impl Div for Modint2 {
    type Output = Self;
    fn div(self, rhs: Self) -> Self {
        assert!(self.m == rhs.m);
        self * rhs.inv()
    }
}

impl AddAssign for Modint2 {
    fn add_assign(&mut self, rhs: Self) {
        assert!(self.m == rhs.m);
        self.value = (*self + rhs).value
    }
}

impl SubAssign for Modint2 {
    fn sub_assign(&mut self, rhs: Self) {
        assert!(self.m == rhs.m);
        self.value = (*self - rhs).value
    }
}

impl MulAssign for Modint2 {
    fn mul_assign(&mut self, rhs: Self) {
        assert!(self.m == rhs.m);
        self.value = (*self * rhs).value
    }
}

impl DivAssign for Modint2 {
    fn div_assign(&mut self, rhs: Self) {
        assert!(self.m == rhs.m);
        self.value = (*self / rhs).value
    }
}

impl Add<usize> for Modint2 {
    type Output = Self;
    fn add(self, rhs: usize) -> Self {
        self + Modint2::new(rhs, self.m)
    }
}

impl Sub<usize> for Modint2 {
    type Output = Self;
    fn sub(self, rhs: usize) -> Self {
        self - Modint2::new(rhs, self.m)
    }
}

impl Mul<usize> for Modint2 {
    type Output = Self;
    fn mul(self, rhs: usize) -> Self {
        self * Modint2::new(rhs, self.m)
    }
}

impl Div<usize> for Modint2 {
    type Output = Self;
    fn div(self, rhs: usize) -> Self {
        self / Modint2::new(rhs, self.m)
    }
}

impl AddAssign<usize> for Modint2 {
    fn add_assign(&mut self, rhs: usize) {
        *self += Modint2::new(rhs, self.m)
    }
}

impl SubAssign<usize> for Modint2 {
    fn sub_assign(&mut self, rhs: usize) {
        *self -= Modint2::new(rhs, self.m)
    }
}

impl MulAssign<usize> for Modint2 {
    fn mul_assign(&mut self, rhs: usize) {
        *self *= Modint2::new(rhs, self.m)
    }
}

impl DivAssign<usize> for Modint2 {
    fn div_assign(&mut self, rhs: usize) {
        *self /= Modint2::new(rhs, self.m)
    }
}

impl Display for Modint2 {
    fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
        write!(f, "{}", self.value)
    }
}

impl PartialEq<usize> for Modint2 {
    fn eq(&self, other: &usize) -> bool {
        self == &Modint2::new(*other, self.m)
    }
}

pub trait Fp {
    fn pow(&self, rhs: usize) -> Self;
    /// $`a^{-1}`$ を返す.逆元が存在しない場合はpanicする.
    fn inv(&self) -> Self;
}

impl Fp for Modint2 {
    fn pow(&self, rhs: usize) -> Self {
        let (mut a, mut b) = (self.value, rhs);
        let mut res = 1;
        while b > 0 {
            if b & 1 == 1 {
                res = (res * a) % self.m;
            }
            a = (a * a) % self.m;
            b >>= 1u32;
        }
        Modint2::new(res, self.m)
    }

    fn inv(&self) -> Self {
        let x = inv(self.value as isize, self.m as isize).unwrap() as usize;
        Modint2::new(x, self.m)
    }
}