2020-05-16

矩阵乘法

#include
#include

using namespace std;

#define N 205

vector a[N], b[N];
vector result[N];

int main()
{
int m, s, n;

cin >> m >> s >> n;

for (int i = 0; i <m; i++)
{
	for (int j = 0; j < s; j++)
	{
		int val1;
		cin >> val1;
		a[i].push_back(val1);
	}
}

for (int i = 0; i < s; i++)
{
	for (int j = 0; j < n; j++)
	{
		int val2;
		cin >> val2;
		b[i].push_back(val2);
	}
}

for (int k = 0; k < m; k++)
{
	for (int i = 0; i < n; i++)
	{
		int sum = 0;
		for (int j = 0; j < s; j++)
		{
			sum = sum + a[k][j] * b[j][i];
		}
	
		result[k].push_back(sum);
	}

}

for (int i = 0; i < m; i++)
{
	for (int j = 0; j < n; j++)
	{
		cout << result[i][j] << " ";
	}
	cout << endl;
}

return 0;

}