机试真题 矩阵乘法

#include<iostream>
#include<vector>
using namespace std;
const int maxn = 100;

int m, n, p;
int m1[maxn][maxn], m2[maxn][maxn],m3[maxn][maxn];

int main() {
	cin >> m >> n >> p;
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			cin >> m1[i][j];
		}
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < p; j++) {
			cin >> m2[i][j];
		}
	}
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < p; j++) {
			m3[i][j] = 0;
			for (int k = 0; k < n; k++) {
				m3[i][j] += m1[i][k] * m2[k][j];
			}
		}
	}
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < p; j++) {
			cout << m3[i][j] << " ";
		}
		cout << endl;
	}
}