| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 139383 | 邹文浠白云六中 | 矩阵加法 | C++ | Wrong Answer | 0 | 0 MS | 268 KB | 436 | 2024-03-23 17:22:23 |
#include <bits/stdc++.h> using namespace std; int a[110][110],b[110][110],n,m; int main() { ios::sync_with_stdio(0); cin >> n >> m; for(int i = 0;i < n;i++) { for(int j = 0;j < n;j++) { cin >> a[i][j]; } } for(int i = 0;i < n;i++) { for(int j = 0;j < n;j++) { cin >> b[i][j]; } } for(int i = 0;i < n;i++) { for(int j = 0;j < n;j++) { cout << a[i][j] + b[i][j]; } } }