矩阵乘法的学习

计算两个矩阵的乘法。

n×m阶的矩阵A乘以m×k阶的矩阵B得到的矩阵C 是n×k阶的，且C[i][j] = A[i][0]×B[0][j] + A[i][1]×B[1][j] + …… +A[i][m-1]×B[m-1][j](C[i][j]表示C矩阵中第i行第j列元素)。

#include<iostream>
using namespace std;
int main()
{
	int n, m,a[110][110],b[110][110],c[110][110],k;
	cin >> n >> m >> k;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cin >> a[i][j];
		}
	}
    for (int i = 1; i <= m; i++)
    {
		for (int j = 1; j <= k; j++)
		{
			cin >> b[i][j];
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= k; j++)
		{    
			c[i][j] = 0;
			for (int p = 1; p <= m; p++)
			{
				c[i][j] += a[i][p] * b[p][j];
			}

		}

	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= k; j++)
		{
			cout << c[i][j]<<" ";
		}
		cout << endl;
	}

}