| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 88771 | sh25_chenyj | 矩阵加法 | C++ | Accepted | 0 MS | 248 KB | 534 | 2026-05-15 15:39:56 |
#include<bits/stdc++.h> using namespace std; int main() { int n , m; cin>>n>>m; int ls1[n][m], ls2[n][m]; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ cin>>ls1[i][j]; } } for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ cin>>ls2[i][j]; } } int ls3[n][m]; for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ ls3[i][j] = ls1[i][j]+ls2[i][j]; } } for(int i = 0; i < n; i++){ for(int j = 0; j < m; j++){ cout<<ls3[i][j]<<" "; } cout<<endl; } }