矩阵乘法

点击查看代码

#include<iostream>
using namespace std;
int main()
{
	int a[100][100], b[100][100];
	int n, m, k;
	cin >> n >> m >> k;
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			cin >> a[i][j];
		}
	}
	for (int i = 0; i < m; i++)
	{
		for (int j = 0; j < k; j++)
		{
			cin >> a[i][j];
		}
	}
	int c[100][100] = { 0 };
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			for (int h = 0; h < k; h++)
			{
				c[i][j] = a[i][h] * b[h][j];
			}
		}
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < k; j++)
		{
			cout << c[i][j] << " ";
		}
		cout << endl;
	}
	return 0;
}