模板题,注意取模以及快速幂中需ret初始化成单位矩阵才能操作。
P.S.懒得封装了,估计NOIP考到这玩意我也没闲心去重载个什么乘法。。。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=104,MOD=1e9+7;
typedef long long ll;
int n;
struct Matrix {
int c[N][N];
Matrix() {memset(c,0,sizeof(c));}
};
Matrix mult(Matrix a,Matrix b) {
Matrix ret;
for (int k=1;k<=n;++k)
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
(ret.c[i][j]+=1ll*a.c[i][k]*b.c[k][j]%MOD)%=MOD;
return ret;
}
Matrix fpow(Matrix a,ll b) {
Matrix ret;
for (int i=1;i<=n;++i) ret.c[i][i]=1;
while (b) {
if (b&1) ret=mult(ret,a);
a=mult(a,a),b>>=1;
}
return ret;
}
Matrix mpro;
ll m;
int main() {
scanf("%d%lld",&n,&m);
for (int i=1;i<=n;++i)
for (int j=1;j<=n;++j)
scanf("%lld",&mpro.c[i][j]);
mpro=fpow(mpro,m);
for (int i=1;i<=n;++i) {
for (int j=1;j<=n;++j)
printf("%lld ",mpro.c[i][j]);
puts("");
}
return 0;
}