矩阵快速幂

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=110;
const int mod=1e9+7;
ll tmp[N][N],res[N][N],base[N][N];
long long n,k;
inline ll read(){
    ll x=0,f=1;char c=getchar();
    while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+(c^48);c=getchar();}
    return x*f;
}
void multi(long long a[][N],long long b[][N]){
    memset(tmp,0,sizeof(tmp));
    for(long long i=0;i<n;++i)
        for(long long j=0;j<n;++j)
            for(long long k=0;k<n;++k)
                tmp[i][j]=(tmp[i][j]+a[i][k]*b[k][j]%mod)%mod;
    for(long long i=0;i<n;++i)
        for(long long j=0;j<n;++j)
            a[i][j]=tmp[i][j];
}
void power(long long a[][N]){
    for(int i=0;i<n;++i)  res[i][i]=1;
    while(k){
        if(k&1)  multi(res,a);
        multi(a,a);
        k>>=1;
    }
}
int main(){
    n=read();k=read();
    for(int i=0;i<n;++i)
        for(int j=0;j<n;++j)
            base[i][j]=read();
    power(base);
    for(int i=0;i<n;++i){
        for(int j=0;j<n;++j)
            cout<<res[i][j]<<" ";
        cout<<endl;
    }
        
}

 不具有交换律