题解 | #矩阵乘法#
矩阵乘法
https://www.nowcoder.com/practice/ebe941260f8c4210aa8c17e99cbc663b
#include <stdio.h>
int main()
{
int x = 0;
int y = 0;
int z = 0;
scanf("%d\n%d\n%d\n", &x,&y,&z);
int arr1[x][y];
for (int i = 0; i < x; i++)
for (int j = 0; j < y; j++)
scanf("%d", &arr1[i][j]);
int arr2[y][z];
for (int i = 0; i < y; i++)
for (int j = 0; j < z; j++)
scanf("%d", &arr2[i][j]);
int arr3[x][z];
for (int i = 0; i < x; i++)
for (int j = 0; j < z; j++)
{
int num = 0;
for (int k = 0; k < y; k++)
num += arr1[i][k] * arr2[k][j];
arr3[i][j] = num;
}
for (int i = 0; i < x; i++)
{
for (int j = 0; j < z; j++)
printf("%d ", arr3[i][j]);
printf("\n");
}
return 0;
}
