中国石油大学开放训练赛 F.求和（矩阵快速幂）-CSDN博客

本文链接：https://blog.csdn.net/qq_43346369/article/details/104813936

数学-数论

求和（矩阵构造+矩阵快速幂）

题目

已知A为n*n矩阵，求 $S=A+A^2+A^3+\dots+A^m$ 中每一项对1e9+7取模后的值
输入
1 2019
1
输出
2019

可以构造一个矩阵 $B=\begin{bmatrix}A & A\\0 & E\\ \end{bmatrix}$

可以发现： $B^2=\begin{bmatrix}A^2 & A+A^2\\0 & E\\ \end{bmatrix}$

$B^3=\begin{bmatrix}A^3 & A+A^2+A^3\\0 & E\\ \end{bmatrix}$

$B^m=\begin{bmatrix}A^m & A+A^2+A^3+\dots+A^m\\0 & E\\ \end{bmatrix}$

所以只需求出 $B^m$ 即可

#include <bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
#define endl '\n'
typedef long long ll;
const int MOD = 1000000007;
const int maxn = 60 + 10;
int n, m;
struct Matrix {
	ll m[maxn][maxn];
	Matrix() { memset(m, 0, sizeof(m)); }
} a, b, ans;
Matrix Multi(Matrix a, Matrix b) //矩阵乘法
{
	Matrix res;
	for (int i = 0; i < maxn; i++) {
		for (int j = 0; j < maxn; j++) {
			for (int k = 0; k < maxn; k++) {
				res.m[i][j] = (res.m[i][j] + a.m[i][k] * b.m[k][j]) % MOD;
			}
		}
	}
	return res;
}
Matrix fastm(Matrix a, int n) //矩阵快速幂
{
	Matrix res;
	for (int i = 0; i < maxn; i++) { //初始化为单位矩阵
		res.m[i][i] = 1;
	}
	while (n) {
		if (n & 1) {
			res = Multi(res, a);
		}
		a = Multi(a, a);
		n >>= 1;
	}
	return res;
}
int main()
{
	ios::sync_with_stdio(0), cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cin >> a.m[i][j];
			b.m[i][j] = a.m[i][j];
		}
	}
	//构造b
	for (int i = 1; i <= n; i++) {
		for (int j = n + 1; j <= 2 * n; j++) {
			b.m[i][j] = a.m[i][j - n];
		}
	}
	for (int i = n + 1; i <= 2 * n; i++) {
		b.m[i][i]=1;
	}
	ans = fastm(b, m);
	for (int i = 1; i <= n; i++) {
		for (int j = n + 1; j <= 2 * n; j++) {
			cout << ans.m[i][j] % MOD << " ";
		}
		cout << endl;
	}
}