-
Notifications
You must be signed in to change notification settings - Fork 44
Expand file tree
/
Copy pathMatrix.java
More file actions
60 lines (59 loc) · 1.29 KB
/
Matrix.java
File metadata and controls
60 lines (59 loc) · 1.29 KB
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
static class Matrix {
public int n, MOD;
public int[][] x;
public Matrix(int n, int MOD) {
this.n = n;
this.MOD = MOD;
x = new int[n][n];
}
public Matrix add(Matrix A) {
Matrix res = new Matrix(n, MOD);
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++) {
res.x[i][j] = x[i][j] + A.x[i][j];
if (res.x[i][j] >= MOD) res.x[i][j] -= MOD;
}
return res;
}
public Matrix mul(Matrix A) {
Matrix res = new Matrix(n, MOD);
for (int i = 0; i < n; i++) {
for (int k = 0; k < n; k++) {
for (int j = 0; j < n; j++) {
res.x[i][j] = (int) ((res.x[i][j] + (long) x[i][k] * A.x[k][j]) % MOD);
}
}
}
return res;
}
public Matrix pow(long k) {
Matrix res = this, tmp = this;
k--;
while (k > 0) {
if ((k & 1) == 1) {
res = res.mul(tmp);
}
tmp = tmp.mul(tmp);
k >>= 1;
}
return res;
}
public Matrix sumpower(Matrix A, long k) {
if (k == 1) return A;
ArrayList<Integer> bit = new ArrayList<>();
while (k > 0) {
bit.add((int) (k & 1));
k >>= 1;
}
Matrix res = A, tmp = A;
for (int i = bit.size() - 2; i >= 0; i--) {
res = res.add(res.mul(tmp));
tmp = tmp.mul(tmp);
if (bit.get(i) % 2 == 1) {
tmp = tmp.mul(A);
res = res.add(tmp);
}
}
return res;
}
}