1 条题解
-
0
#include <bits/stdc++.h> using namespace std; #define int long long #define endl '\n' void solve() { int n; cin >> n; int a[n+1][n+1]; int num = 1; for(int i = 1; i <= 2 * n - 1; i++){ if(i&1){ int row = (i <= n ? i : n); int col = (i <= n ? 1 : i - n + 1); while(row >= 1 && col <= n){ a[row][col] = num++; row--; col++; } }else{ int row = (i <= n ? 1 : i - n + 1); int col = (i <= n ? i : n); while(row <= n && col >= 1){ a[row][col] = num++; row++; col--; } } } for(int i = 1; i <= n; i++){ for(int j = 1; j <= n; j++){ cout << a[i][j] << " "; } cout << '\n'; } } signed main() { ios::sync_with_stdio(0); cin.tie(0),cout.tie(0); int T = 1; // cin >> T; while (T--) solve(); return 0; }
信息
- ID
- 1157
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 8
- 标签
- 递交数
- 16
- 已通过
- 6
- 上传者