| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 146173 | 陈锐锋 | 矩阵倒序输出 | C++ | Wrong Answer | 1 MS | 272 KB | 364 | 2026-01-27 13:50:56 |
#include<bits/stdc++.h> using namespace std; int main() { int n, m, a[15][15]; cin >> n >> m; int sum = 0; for (int i = 1; i <= n; ++i) { for (int j = 1; j <= m; ++j) { cin >> a[i][j]; sum += a[i][j]; } } for (int i = 2; i <= n - 1; i++) { for (int j = 2; j <= m - 1; j++) { sum -= a[i][j]; } } cout << sum; return 0; }
------Input------
3 3 1 2 3 4 5 6 7 8 9
------Answer-----
3 2 1 6 5 4 9 8 7
------Your output-----
40