mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-24 18:11:59 +00:00
1302. 矩阵 A × B
https://www.acwing.com/problem/content/submission/code_detail/13761403/
This commit is contained in:
parent
2e68eed36c
commit
d530e59734
69
AcWing/1302/1302.cpp
Normal file
69
AcWing/1302/1302.cpp
Normal file
@ -0,0 +1,69 @@
|
||||
#include <cstring>
|
||||
#include <iostream>
|
||||
|
||||
using std::cin;
|
||||
using std::cout;
|
||||
const char endl = '\n';
|
||||
|
||||
const int N = 105;
|
||||
|
||||
int n, m, p;
|
||||
|
||||
class Matrix {
|
||||
private:
|
||||
int data[N][N];
|
||||
|
||||
public:
|
||||
Matrix() {
|
||||
memset(data, 0x00, sizeof(data));
|
||||
}
|
||||
|
||||
int* operator[](int i) {
|
||||
return data[i];
|
||||
}
|
||||
|
||||
Matrix operator*(Matrix b) const {
|
||||
Matrix c;
|
||||
|
||||
for (int i = 1; i <= n; i++) {
|
||||
for (int j = 1; j <= p; j++) {
|
||||
for (int k = 1; k <= m; k++) {
|
||||
c[i][j] += data[i][k] * b[k][j];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return c;
|
||||
}
|
||||
} a, b, c;
|
||||
|
||||
int main() {
|
||||
std::ios::sync_with_stdio(false);
|
||||
|
||||
cin >> n >> m;
|
||||
|
||||
for (int i = 1; i <= n; i++) {
|
||||
for (int j = 1; j <= m; j++) {
|
||||
cin >> a[i][j];
|
||||
}
|
||||
}
|
||||
|
||||
cin >> p;
|
||||
|
||||
for (int i = 1; i <= m; i++) {
|
||||
for (int j = 1; j <= p; j++) {
|
||||
cin >> b[i][j];
|
||||
}
|
||||
}
|
||||
|
||||
c = a * b;
|
||||
|
||||
for (int i = 1; i <= n; i++) {
|
||||
for (int j = 1; j <= p; j++) {
|
||||
cout << c[i][j] << ' ';
|
||||
}
|
||||
cout << endl;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
Loading…
Reference in New Issue
Block a user