题解 | #矩阵 A×B#

矩阵快速幂模板题

#include <iostream>

using namespace std;

const int N = 110;

int n, m, p;
int a[N][N], b[N][N], c[N][N];

int main()
{
    cin >> n >> m;
    for (int i = 0; i < n; i ++) for (int j = 0; j < m; j ++) cin >> a[i][j];
    cin >> p;
    for (int i = 0; i < m; i ++) for (int j = 0; j < p; j ++) cin >> b[i][j];
    
    for (int i = 0; i < n; i ++)
        for (int j = 0; j < m; j ++)
            for (int k = 0; k < p; k ++)
                c[i][k] += a[i][j] * b[j][k];
                
    for (int i = 0; i < n; i ++)
    {
        for (int j = 0; j < p; j ++)
            cout << c[i][j] << ' ';
        cout << endl;
    }
    
    return 0;
}