题解 | #矩阵乘法#

#include <iostream>
using namespace std;
int main()
{
    int x,y,z;
    while (cin >> x >> y >> z)
    {
        int number,A[x][y],B[y][z],C[x][z];
        for (int i = 0; i < x; i++)
            for (int k = 0; k < y; k++)
                cin >> A[i][k];
        for (int k = 0; k < y; k++)
            for (int j = 0; j < z; j++)
                cin >> B[k][j];
        for (int i = 0; i < x; i++)
        {
            for (int j = 0; j < z; j++)
            {
                C[i][j]=0;
                for (int k = 0; k < y; k++)
                    C[i][j] += A[i][k] * B[k][j];
                cout << C[i][j] << ' ';
            }
            cout << endl;
        }
    }
}