| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 86450 | 刘昊炜 | 矩阵加法 | C++ | Output Limit Exceeded | 2 MS | 296 KB | 504 | 2024-07-25 14:51:38 |
#include<iostream> using namespace std; int main() { int n, m; cin >> n >> m; int a[n][n] = {0}, b[m][m] = {0}; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { cin >> a[i][j]; } } for (int i = 0; i < m; i++) { for (int j = 0; j < m; j++) { cin >> b[i][j]; } } int c = 0; if (n > m) { c = n; } else { c = m; } for (int i = 0; i < c; i++) { for (int j = 0; j < c; j++) { cout << a[i][j] + b[i][j] << " "; } cout << endl; } }