Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
29387 | 郑涵依 | 矩阵乘法 | C++ | Accepted | 9 MS | 864 KB | 632 | 2022-07-09 11:41:10 |
//oj1522 #include <bits/stdc++.h> using namespace std; int main() { int n, m, k; int a[100][100], b[100][100], c[100][100]; cin >> n >> m >> k; 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 s = 0; s < m; s ++) { c[i][j] += a[i][s] * b[s][j]; } } } for (int i = 0; i < n; i ++) { for (int j = 0; j < k; j ++) { cout << c[i][j] << " "; } cout << endl; } return 0; }