矩阵相乘计算

#include<iostream>
using namespace std;
int main()
{
	int m, n, k;//a矩阵为m*n,b矩阵为n*k,即c矩阵为m*k
	double a[10][10], b[10][10], c[10][10];
	memset(a, 0, sizeof(a));//数组清零
	memset(b, 0, sizeof(b));
	memset(c, 0, sizeof(c));
	while (cin >> m >> n >> k)
	{
		cout << endl;
		for (int i = 0; i < m; i++)
			for(int j=0;j<n;j++)
			cin >> a[i][j];//a矩阵输入
		cout << endl;
		for (int i = 0; i < n; i++)
			for (int j = 0; j < k; j++)
				cin >> b[i][j];//b矩阵输入
		cout << endl;
		for (int i = 0; i < m; i++)
		{
			for (int j = 0; j < k; j++)
			{
				int sum = 0;
				for (int l = 0; l < n; l++)
					sum += a[i][l] * b[l][j];//计算
				cout << sum << " ";
			}
			cout << endl;
		}
	}
}