蓝桥杯 ALGO-86 矩阵乘法（数组l）

【思路】：同前。最简单的三重循环。

【AC代码】：

#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;

#define MAX 200+5

int main()
{
	//freopen("in.txt", "r", stdin);
	int m = 0, s = 0, n = 0, matrix_a[MAX][MAX], matrix_b[MAX][MAX], matrix_c[MAX][MAX];
	int i = 0, j = 0, k = 0;
	
	//input
	cin >> m >> s >> n;
	for (i = 0; i < m; i++)
	{
		for (j = 0; j < s; j++)
			cin >> matrix_a[i][j];
	}
	for (i = 0; i < s; i++)
	{
		for (j = 0; j < n; j++)
			cin >> matrix_b[i][j];
	}
	
	//mul
	for (i = 0; i < m; i++)
	{
		for (j = 0; j < n; j++)
		{
			int sum = 0;
			for (k = 0; k < s; k++)
			{
				sum += (matrix_a[i][k] * matrix_b[k][j]);
			}
			matrix_c[i][j] = sum;
		}
	}
	
	//output
	for (i = 0; i < m; i++)
	{
		for (j = 0; j < n; j++)
			cout << matrix_c[i][j] << " ";
		cout << endl;
	}
}