Algorithms/matrix at master · Vergara7/Algorithms · GitHub

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
const int mod = 1e9 + 7;

struct matrix{

	int n, m;
	vector<vector<ll> > s;

	matrix(int n) : n(n), m(n) {
		s.resize(n);
		for (int i = 0; i < n; i++){
			s[i].resize(m);
			fill(s[i].begin(), s[i].end(), 0);
		}
	}

	matrix(int n, int m) : n(n), m(m) {
		s.resize(n);
		for (int i = 0; i < n; i++){
			s[i].resize(m);
			fill(s[i].begin(), s[i].end(), 0);
		}
	}

	vector<ll>& operator[](int x){
		return s[x];
	}

	const vector<ll>& operator[](int x) const{
		return s[x];
	}
};

matrix identity(int n){
	matrix a = matrix(n);
	for (int i = 0; i < n; i++)
		a[i][i] = 1;
	return a;
}

void print(matrix a){
	for (int i = 0; i < a.n; i++){
		for (int j = 0; j < a.m; j++)
			cout << a[i][j] << " ";
		cout << endl;
	}
}

matrix operator + (matrix a, matrix b){
	assert(a.n == b.n && a.m == b.m);
	for (int i = 0; i < a.n; i++)
		for (int j = 0; j < a.m; j++)
			a[i][j] += b[i][j];
	return a;
}

void operator += (matrix &a, matrix b){
	assert(a.n == b.n && a.m == b.m);
	for (int i = 0; i < a.n; i++)
		for (int j = 0; j < a.m; j++)
			a[i][j] += b[i][j];
}

matrix operator - (matrix a, matrix b){
	assert(a.n == b.n && a.m == b.m);
	for (int i = 0; i < a.n; i++)
		for (int j = 0; j < a.m; j++)
			a[i][j] -= b[i][j];
	return a;
}

void operator -= (matrix &a, matrix b){
	assert(a.n == b.n && a.m == b.m);
	for (int i = 0; i < a.n; i++)
		for (int j = 0; j < a.m; j++)
			a[i][j] -= b[i][j];
}

matrix operator * (matrix a, matrix b){
	assert(a.m == b.n);
	matrix c = matrix(a.n, b.m);
	for (int i = 0; i < a.n; i++){
		for (int j = 0; j < b.m; j++){
			for (int k = 0; k < a.m; k++){
				c[i][j] += a[i][k] * b[k][j];
				c[i][j] %= mod;
			}
		}
	}
	return c;
}

void operator *= (matrix &a, matrix b){
	assert(a.m == b.n);
	matrix c = matrix(a.n, b.m);
	for (int i = 0; i < a.n; i++){
		for (int j = 0; j < b.m; j++){
			for (int k = 0; k < a.m; k++){
				c[i][j] += a[i][k] * b[k][j];
				c[i][j] %= mod;
			}
		}
	}
	for (int i = 0; i < a.n; i++){
		for (int j = 0; j < b.m; j++)
			a[i][j] = c[i][j];
	}
}

matrix power(matrix a, int n){
	assert(a.n == a.m);
	matrix res = identity(a.n);
	while (n > 0){
		if (n & 1)
			res *= a;
		a *= a;
		n >>= 1;
	}
	return res;
}

bool operator == (matrix a, matrix b){
	assert(a.n == b.n && a.m == b.m);
	for (int i = 0; i < a.n; i++)
		for (int j = 0; j < a.m; j++)
			if (a[i][j] != b[i][j])
				return false;
	return true;
}