51Nod 1113 矩阵快速幂

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;

typedef long long ll;
int n, m;
const int maxn = 105;
const int MOD = 1e9 + 7;

struct node{
    ll a[maxn][maxn];
};

node A, ans;

node multi(node x, node y){
    node z;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            z.a[i][j] = 0;
            for(int k = 1;k <= n;k++){
                z.a[i][j] += x.a[i][k]*y.a[k][j]%MOD;
                z.a[i][j] %= MOD;
            }
        }
    }
    return z;
}

void f(){
    while(m > 0){
        if(m%2){
            //ans = ans*a%MOD;
            ans = multi(ans, A);
        }
        //a = (a*a)%MOD;
        A = multi(A,A);
        m /= 2;
    }
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= n;j++){
            cin >> A.a[i][j];
            ans.a[i][j] = A.a[i][j];
        }
    }
    m--;
    f();
    for(int  i = 1;i <= n;i++){
        for(int j = 1;j<=n;j++)
        {
            if(j == 1){
                cout << ans.a[i][j];
            }
            else{
                cout << " " << ans.a[i][j];
            }
        }
        cout << endl;
    }
    return 0;
}