洛谷 - P3390 矩阵快速幂（矩阵模板）

传送门：洛谷 - P3390

思路分析

矩阵模板

AC代码

#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define fun function
#define sz(x) (x).size()
#define lowbit(x) (x)&(-x)
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))

namespace FastIO {
#define BUF_SIZE 100000
#define OUT_SIZE 100000
    bool IOerror=0;
    inline char nc() {
        static char buf[BUF_SIZE],*p1=buf+BUF_SIZE,*pend=buf+BUF_SIZE;
        if(p1==pend) {
            p1=buf;
            pend=buf+fread(buf,1,BUF_SIZE,stdin);
            if(pend==p1) {
                IOerror=1;
                return -1;
            }
        }
        return *p1++;
    }
    inline bool blank(char ch) {
        return ch==' '||ch=='\n'||ch=='\r'||ch=='\t';
    }
    template<class T> inline bool read(T &x) {
        bool sign=0;
        char ch=nc();
        x=0;
        for(; blank(ch); ch=nc());
        if(IOerror)return false;
        if(ch=='-')sign=1,ch=nc();
        for(; ch>='0'&&ch<='9'; ch=nc())x=x*10+ch-'0';
        if(sign)x=-x;
        return true;
    }
    template<class T,class... U>bool read(T& h,U&... t) {
        return read(h)&&read(t...);
    }
#undef OUT_SIZE
#undef BUF_SIZE
};
using namespace std;
using namespace FastIO;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

typedef long long ll;
typedef pair<int,int> pii;
typedef unsigned long long ull;
#define int long long
const int INF = 0x3f3f3f3f;
const int mod = 1e9+7;

struct Mat {
    int n;
    vector<vector<int>>a;
    Mat(){}
    Mat(int nn){
        n = nn;
        a.resize(n+2);
        for(int i=1; i<=n; i++) a[i].resize(n+2);
    }
    Mat operator* (const Mat B) const {
        Mat res(n);
        ll r;
        for(int i=1;i<=n;i++){
            for(int k = 1;k<=n;k++){
                r = a[i][k];
                for(int j = 1;j<=n;j++){
                    res.a[i][j] += B.a[k][j]*r;
                    res.a[i][j]%=mod;
                }
            }
        }
        return res;
    }
    
    Mat pow(int x){
        Mat res(n),bas(n);
        for(int i=1;i<=n;i++) res.a[i][i] = 1;
        bas.a = a;
        while(x){ 
            if(x&1) res = res*bas;
            x>>=1;
            bas = bas*bas;
        }
        a = res.a;
        return res;
    }
    
    void print(){
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                cout<<a[i][j]<<" ";
            }
            cout<<endl;
        }
    }
};

signed main() {

#ifdef xiaofan
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
#endif

    int n,k;
    cin>>n>>k;
    Mat a(n);
    for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) cin>>a.a[i][j];
    a.pow(k);
    a.print();    



    return 0;
}