Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
117410 | 殷佳雨萱 | 矩阵对角线 | C++ | Accepted | 16 MS | 308 KB | 493 | 2025-04-19 07:04:53 |
#include <iostream> using namespace std; int a[105][105]; int main() { int n, m; 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++) { if (a[i][i] == a[i][n - 1 - i]) { a[i][i] += m; continue; } a[i][i] += m; a[i][n - 1 - i] += m; } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { printf("%5d", a[i][j]); } cout << endl; } return 0; }