题解 | #矩阵乘法#

#include <stdio.h>

int main() {
    int m, n,l;
    scanf("%d\n%d\n%d\n",&m,&n,&l);
    int a[m][n],b[n][l];
    for (int i = 0; i<m; i++) {
        for (int j = 0; j<n; j++) {
            scanf("%d",&a[i][j]);
        }
    }
    for (int i = 0; i<n; i++) {
        for (int j = 0; j<l; j++) {
            scanf("%d",&b[i][j]);
            // printf("%d ",b[i][j]);
        }
    }

    int result[m][l];

    for (int i = 0; i<m; i++) {
        for (int j = 0; j<l; j++) {
            result[i][j] = 0;
            for (int k = 0; k<n; k++) {
                result[i][j] += a[i][k]*b[k][j];
                    //printf("%d ",b[k][j]);
            }
            
        }
    }

for (int i = 0; i<m; i++) {
    for (int j = 0; j<l; j++) {
        printf("%d ",result[i][j]);
    }
    printf("\n");
}


    return 0;
}