P3390 【模板】矩阵快速幂

P3390 【模板】矩阵快速幂

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 105, mod = 1e9+7;
ll n, k;
struct MAT {
    ll a[maxn][maxn];
    MAT(){ memset(a,0,sizeof(a)); }
    MAT operator*(MAT p) {
        MAT res;
        for (int i = 0; i < n; i++)
            for (int j = 0; j < n; j++)
                for(int k = 0; k < n; k++)
                    res.a[i][j] = (res.a[i][j]+a[i][k]*p.a[k][j])%mod;
        return res;
    }
};
MAT mat_qpow(MAT A, ll b) {
    MAT res;
    for (int i = 0; i < n; i++)
        res.a[i][i] = 1;
    while(b) {
        if(b&1) res = res*A;
        A = A*A;
        b >>= 1;
    }
    return res;
}

int main() {
    scanf("%lld%lld",&n,&k);
    MAT A, ans;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            scanf("%lld",&A.a[i][j]);
        }
    }
    ans = mat_qpow(A,k);
    for (int i = 0; i < n; i++) {
        printf("%lld",ans.a[i][0]);
        for (int j = 1; j < n; j++) {
            printf(" %lld",ans.a[i][j]);
        }
        putchar('\n');
    }
    return 0;
}