- 龙凤苑中学3.21
A 矩阵乘法
- @ 2025-3-21 17:02:05
#include <iostream>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m >> k;
int A[100][100], B[100][100], C[100][100];
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
cin >> A[i][j];
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < k; ++j) {
cin >> B[i][j];
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
for (int l = 0; l < m; ++l) {
C[i][j] += A[i][l] * B[l][j];
}
}
}
for (int i = 0; i < n; ++i) {
for (int j = 0; j < k; ++j) {
if (j > 0) cout << " ";
cout << C[i][j];
}
cout << endl;
}
return 0;
}
0 comments
No comments so far...