P3390矩阵快速幂

下面就是矩阵快速幂的模板

矩阵乘法满足结合律,故可以用快速幂加速计算

时间复杂度O(n^3 logK)

#include<bits/stdc++.h>
#define endl '\n'
#define int int64_t
using namespace std;
const int mod = 1e9 + 7;
struct matrix {
	int c[101][101];
	matrix() { memset(c, 0, sizeof(c)); }
}A, res;
int n;
matrix operator*(matrix& a, matrix& b) {
	matrix t;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			for (int k = 1; k <= n; ++k)
				t.c[i][j] = (t.c[i][j] + a.c[i][k] * b.c[k][j]) % mod;
	return t;
}
void qpow(matrix& a, int b) {
	for (int i = 1; i <= n; ++i)res.c[i][i] = 1;
	while (b) {
		if (b & 1)res = res * a;
		a = a * a, b >>= 1;
	}
}
signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	int b;
	cin >> n >> b;
	matrix a;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j)
			cin >> a.c[i][j];
	qpow(a, b);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			cout << res.c[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}