题解 | 计算两个矩阵的乘积

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <string.h>
using namespace std;
void MultiplyArr(int arr1[2][3], int arr2[3][2], int res[2][2])
{
	res[0][0] = arr1[0][0] * arr2[0][0] + arr1[0][1] * arr2[1][0] + arr1[0][2] * arr2[2][0];
	res[0][1] = arr1[0][0] * arr2[0][1] + arr1[0][1] * arr2[1][1] + arr1[0][2] * arr2[2][1];
	res[1][0] = arr1[1][0] * arr2[0][0] + arr1[1][1] * arr2[1][0] + arr1[1][2] * arr2[2][0];
	res[1][1] = arr1[1][0] * arr2[0][1] + arr1[1][1] * arr2[1][1] + arr1[1][2] * arr2[2][1];
}

int main()
{
	//获取数据
	int arr1[2][3];
	for (int i = 0; i < 2; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			scanf("%d", &arr1[i][j]);
		}
	}
	int arr2[3][2];
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 2; j++)
		{
			scanf("%d", &arr2[i][j]);
		}
	}
	//乘积
	int res[2][2];
	MultiplyArr(arr1, arr2, res);
	for (int i = 0; i < 1; i++)
	{
		for (int j = 0; j < 2; j++)
		{
			printf("%d ", res[i][j]);
		}
	}
	printf("\n");
	for (int i = 1; i < 2; i++)
	{
		for (int j = 0; j < 2; j++)
		{
			printf("%d ", res[i][j]);
		}
	}
	return 0;
}