struct mat {
ll a[4][4], n;
mat() { memset(a, 0, sizeof(a)); }
void matE() {
for (int i = 0; i < n; i++)a[i][i] = 1;
}
inline mat operator+(const mat &T) const {
mat res;
res.n = n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
res.a[i][j] = (a[i][j] + T.a[i][j] + mod) % mod;
return res;
}
inline mat operator-(const mat &T) const {
mat res;
res.n = n;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
res.a[i][j] = (a[i][j] - T.a[i][j] + mod) % mod;
return res;
}
inline mat operator*(const mat &T) const {
mat res;
res.n = n;
ll r;
for (int i = 0; i < n; ++i)
for (int k = 0; k < n; ++k) {
r = a[i][k];
for (int j = 0; j < n; ++j)
res.a[i][j] += T.a[k][j] * r,
res.a[i][j] %= mod;
}
return res;
}
inline mat pow(ll x) {
mat res, bas;
res.n = bas.n = n;
for (int i = 0; i < n; i++) res.a[i][i] = 1;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) bas.a[i][j] = a[i][j];
while (x) {
if (x & 1) res = res * bas;
x >>= 1;
bas = bas * bas;
}
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) a[i][j] = res.a[i][j];
return res;
}
}f,a,res;
矩阵重载模板
最新推荐文章于 2022-07-07 09:18:33 发布