题解 | #矩阵乘法#

#include <stdio.h>
#include <stdlib.h>

int arr[2][100][100] = {};
int result[100][100] = {};

int main() {
    int x,y,z,i,j,k;
    int c = 0;
    
    scanf("%d\n%d\n%d", &x, &y, &z);
    
    for (i=0; i<x; ++i) {
        for (j=0; j<y; ++j) {
            scanf("%d", &arr[0][i][j]);
        }
    }
    for (i=0; i<y; ++i) {
        for (j=0; j<z; ++j) {
            scanf("%d", &arr[1][i][j]);
        }
    }

    for (i=0; i<x; ++i) {
        for (j=0; j<z; ++j) {
            c = 0;
            for (k=0; k<y; ++k) {
                c += arr[0][i][k]*arr[1][k][j];
            }
            result[i][j] = c;
        }
    }

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

    return 0;
}