| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 158292 | 袁昊贝 | 方阵填数 | C++ | Wrong Answer | 1 MS | 316 KB | 866 | 2026-08-20 18:00:29 |
#include <bits/stdc++.h> using namespace std; int main(){ int N; cin>>N; int a[101][101]; int num=1; int top=0,bottom=N-1,left=0,right=N-1; while (num<=N*N){ for (int i=top;i<=bottom && num<=N*N;i--){ a[i][right]=num; num++; } right--; for (int i=right;i>=left && num<=N*N;i--){ a[bottom][i]=num; num++; } bottom--; for (int i=bottom;i>=top && num<=N*N;i++){ a[i][left]=num; num++; } left++; for (int i=left;i<=right && num<=N*N;i++){ a[top][i]=num; num++; } top++; } for (int i=0;i<N;i++){ for (int j=0;j<N;j++){ cout<<a[i][j]<<" "; } cout<<endl; } return 0; }
------Input------
10
------Answer-----
28 29 30 31 32 33 34 35 36 1 27 58 59 60 61 62 63 64 37 2 26 57 80 81 82 83 84 65 38 3 25 56 79 94 95 96 85 66 39 4 24 55 78 93 100 97 86 67 40 5 23 54 77 92 99 98 87 68 41 6 22 53 76 91 90 89 88 69 42 7 21 52 75 74 73 72 71 70 43 8 20 51 50 49 48 47 46 45 44 9 19 18 17 16 15 14 13 12 11 10
------Your output-----
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0