-
Notifications
You must be signed in to change notification settings - Fork 106
/
Copy path6.11.cpp
60 lines (52 loc) · 1.47 KB
/
6.11.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
/*
* 题目名称:计算两个矩阵的乘积
* 题目来源:哈尔滨工业大学复试上机题
* 题目链接:http://t.cn/Aip450PJ
* 代码作者:杨泽邦(炉灰)
*/
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 100;
struct Matrix {
int matrix[MAXN][MAXN];
int row, col; //行与列
Matrix(int r, int c): row(r), col(c) {} //构造函数
};
Matrix Multiply(Matrix x, Matrix y) { //矩阵乘法
Matrix answer(x.row, y.col);
for (int i = 0; i < answer.row; ++i) {
for (int j = 0; j < answer.col; ++j) {
answer.matrix[i][j] = 0;
for (int k = 0; k < x.col; ++k) {
answer.matrix[i][j] += x.matrix[i][k] * y.matrix[k][j];
}
}
}
return answer;
}
void InputMatrix(Matrix &x) { //矩阵输入
for (int i = 0; i < x.row; ++i) {
for (int j = 0; j < x.col; ++j) {
scanf("%d", &x.matrix[i][j]);
}
}
}
void OutputMatrix(Matrix x) { //矩阵输出
for (int i = 0; i < x.row; ++i) {
for (int j = 0; j < x.col; ++j) {
printf("%d ", x.matrix[i][j]);
}
printf("\n");
}
return ;
}
int main() {
Matrix x(2, 3);
Matrix y(3, 2);
InputMatrix(x);
InputMatrix(y);
Matrix answer = Multiply(x, y);
OutputMatrix(answer);
return 0;
}