矩阵快速幂模板

矩阵快速幂

//#include<bits/stdc++.h>    
#include<iostream>      
#include<cstdio>      
#include<cstdlib>      
#include<cstring>      
#include<string>      
#include<queue>      
#include<algorithm>      
#include<map>      
#include<iomanip>   
#define inf 0x3f3f3f3f      
#define maxn 11
#define maxm 10000
using namespace std;
struct Matrix {
	int ma[maxn][maxn];
};
int n,k;
const int mod = 9973;
Matrix multi(Matrix a, Matrix b) {
	Matrix ans;
	memset(ans.ma, 0, sizeof(ans.ma));
	for(int i=1; i<=n; ++i) {
		for(int j=1; j<=n; ++j) {
			for(int k=1; k<=n; ++k) {
				ans.ma[i][j] = (ans.ma[i][j] + a.ma[i][k] * b.ma[k][j]%mod) % mod;  //矩阵乘法
			}
		}
	}
	return ans;
}

Matrix fastm(Matrix a, int x) {
	Matrix ans;
	memset(ans.ma, 0, sizeof(ans.ma));  //因为这个地方要想乘，所以一开始要初始化为单位矩阵
	for(int i=1; i<=n; ++i)
		ans.ma[i][i] = 1;
	while(x) {                           //快速幂取模
		if(x & 1)
			ans = multi(ans, a);
		a = multi(a, a);
		x = x>>1;
	}
	return ans;
}
int main()
{
	int t;
	Matrix ans;
	scanf("%d",&t);
	while(t--) {
		scanf("%d%d",&n,&k);
		for(int i=1; i<=n; ++i)
			for(int j=1; j<=n; ++j)
				scanf("%d",&ans.ma[i][j]);
		
		ans = fastm(ans,k);
		
	}
}