Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
3794 | 吴奕希 | 矩阵乘法 | C++ | Accepted | 2 MS | 364 KB | 943 | 2024-07-05 19:57:59 |
#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 < k; j++) { C[i][j] = 0; } } 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++) { cout << C[i][j] << " "; } cout << endl; } return 0; }