L1-048 矩阵A乘以B （15 分)

版权声明：SupremeBeast3_ https://blog.csdn.net/weixin_43359312/article/details/89055479

L1-048 矩阵A乘以B （15 分)

输入样例1：
2 3
1 2 3
4 5 6
3 4
7 8 9 0
-1 -2 -3 -4
5 6 7 8
输出样例1：
2 4
20 22 24 16
53 58 63 28
输入样例2：
3 2
38 26
43 -5
0 17
3 2
-11 57
99 68
81 72
输出样例2：
Error: 2 != 3

AC代码

#include <iostream>
using namespace std;
int main() {
	int Ra, Rb, Ca, Cb;
	cin >> Ra >> Ca;
	cin.get();
	int a[101][101];
	for (int i = 0; i < Ra; i++) {
		for (int j = 0; j < Ca; j++) cin >> a[i][j];
		cin.get();
	}
	cin >> Rb >> Cb;
	if (Ca != Rb) {printf("Error: %d != %d\n", Ca, Rb); return 0;}
	int b[101][101];
	for (int i = 0; i < Rb; i++) {
		for (int j = 0; j < Cb; j++) cin >> b[i][j];
		cin.get();
	}
	cout << Ra << ' ' << Cb << endl;
	int ret[101][101] = { 0 };
	int flag = 0;
	for (int i = 0; i < Ra; i++) {
		for (int j = 0; j < Cb; j++) {
			if (flag) cout << ' ';
			else flag = 1;
			for (int p = 0; p < Rb; p++) ret[i][j] += a[i][p] * b[p][j];
			cout << ret[i][j];
			if (j == Cb - 1) { cout << endl; flag = 0; }
		}
	}
	return 0;
}