题解 | #矩阵乘法# C++ 纯暴力

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

int main() {
    int x, y, z;
    cin >> x >> y >> z;
    vector<vector<int>> ma(x, vector<int>(y, 0));
    vector<vector<int>> mb(y, vector<int>(z, 0));
    vector<vector<int>> res(x, vector<int>(z, 0));
    for (int i = 0; i < x; i++) {
        for (int j = 0; j < y; j++) {
            cin >> ma[i][j];
        }
    }
    for (int i = 0; i < y; i++) {
        for (int j = 0; j < z; j++) {
            cin >> mb[i][j];
        }
    }
    for (int i = 0; i < x; i++) {
        for (int j = 0; j < z; j++) {
            for(int k=0;k<y;k++){
                res[i][j] += ma[i][k] * mb[k][j];
            }
            cout<<res[i][j] << " ";
        }
        cout<<endl;
    }
    return 0;

}
// 64 位输出请用 printf("%lld")