题解 | 矩阵乘法

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int x, y, z;
    cin >> x >> y >> z;
    vector<vector<int> > matrixA(x, vector<int>(y, 0));
    vector<vector<int> > matrixB(y, vector<int>(z, 0));

    for(int i = 0; i < x; ++i) {
        for(int j = 0; j < y; ++j) {
            cin >> matrixA[i][j];
        }
    }
    for(int i = 0; i < y; ++i) {
        for(int j = 0; j < z; ++j) {
            cin >> matrixB[i][j];
        }
    }
    for(int i = 0; i < x; ++i) {
        for(int j = 0; j < z; ++j) {
            int sum = 0;
            for(int k = 0; k < y; ++k) {
                sum += matrixA[i][k] * matrixB[k][j];
            }
            cout << sum << " ";
        }
        cout << endl;
    }
    return 0;
}