AcWing 3534. 矩阵幂
原题链接
简单
作者:
369pro
,
2024-03-24 16:53:35
,
所有人可见
,
阅读 7
#include<iostream>
#include<vector>
using namespace std;
vector<vector<int>> pow2(vector<vector<int>>& m1, vector<vector<int>>& m2){
int n = m1.size();
vector<vector<int>> res(n, vector<int>(n, 0));
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
int r = 0;
// 注意此处为核心!!!
for(int k = 0; k < n; k++){
r += m1[i][k]*m2[k][j];
}
res[i][j] = r;
}
}
return res;
}
int main(){
int n, k;
cin >> n >> k;
// 初始化单位矩阵
vector<vector<int>> res(n, vector<int>(n, 0));
for(int i = 0; i < n; i++) res[i][i] = 1;
vector<vector<int>> v(n, vector<int>(n, 0));
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++) cin >> v[i][j];
}
for(int i = 0; i < k; i++){
res = pow2(res, v);
}
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++)
cout << res[i][j] <<" ";
cout << endl;
}
}