【luogu 3390】【模板】矩阵快速幂

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<iostream>
 4 #include<algorithm>
 5 #define ll long long
 6 using namespace std;
 7 const ll Mod=1000000007;
 8 ll n,k;
 9 struct matrix{ll m[105][105];}a;
10 matrix multiply(matrix a,matrix b){
11     matrix t;
12     for(int i=1;i<=n;i++)
13         for(int j=1;j<=n;j++){
14             t.m[i][j]=0;
15             for(int k=1;k<=n;k++)
16                 t.m[i][j]=(t.m[i][j]+a.m[i][k]*b.m[k][j])%Mod;
17         }
18     return t;
19 }
20 matrix fast(matrix a,ll p){
21     matrix ans=a;p--;
22     while(p>0){
23         if(p&1) ans=multiply(ans,a);
24         a=multiply(a,a);
25         p>>=1;
26     }
27     return ans;
28 }
29 int main(){
30     scanf("%lld%lld",&n,&k);
31     for(int i=1;i<=n;i++)
32         for(int j=1;j<=n;j++)
33             scanf("%lld",&a.m[i][j]);
34     a=fast(a,k);
35     for(int i=1;i<=n;i++){
36         for(int j=1;j<=n;j++)
37             printf("%lld ",a.m[i][j]);
38         printf("\n");
39     }
40     return 0;
41 }