题解 | #矩阵乘法#

#include <iostream>
using namespace std;

int main() {
    int x, y, z, n;
    cin >> x >> y >> z;
    int a[x][y];
    int b[y][z];
    int c[x][z];
    for (int i = 0; i < x; i++) {
        for (int j = 0; j < y; j++) {
            cin >> n;
            a[i][j] = n;
        }
    }
    for (int j = 0; j < y; j++) {
        for (int k = 0; k < z; k++) {
            cin >> n;
            b[j][k] = n;
        }
    }
    for (int i = 0; i < x; i++) {
        for (int k = 0; k < z; k++) {
            c[i][k] = 0;
            for (int j = 0; j < y; j++) {
                c[i][k] += (a[i][j] * b[j][k]);
            }
        }
    }
    for (int i = 0; i < x; i++) {
        for (int k = 0; k < z; k++) {
            cout << c[i][k] << ' ';
        }
        cout << endl; //换行，输出矩阵的下一行元素
    }
    return 0;
}