| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 123445 | 勾老师 | 矩阵加法 | C++ | Accepted | 5 MS | 404 KB | 718 | 2025-07-03 14:39:14 |
#include <iostream> using namespace std; int main() { int n, m; cin >> n >> m; int A[101][101], B[101][101], C[101][101]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> A[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { cin >> B[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { C[i][j] = A[i][j] + B[i][j]; } } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (j > 0) cout << " "; cout << C[i][j]; } cout << endl; } return 0; }