5 solutions
-
2
#include<bits/stdc++.h> using namespace std; int sxts[25][25]; int main(){ int n; cin>>n; int x=1; int hang=1,lie=n; sxts[hang][lie]=x; while(x<n*n) { while(hang<n&&sxts[hang+1][lie]==0) { hang++; x++; sxts[hang][lie]=x; } while(lie>1&&sxts[hang][lie-1]==0) { lie--; x++; sxts[hang][lie]=x; } while(hang>1&&sxts[hang-1][lie]==0) { hang--; x++; sxts[hang][lie]=x; } while(lie<n&&sxts[hang][lie+1]==0) { lie++; x++; sxts[hang][lie]=x; } } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cout<<sxts[i][j]<<" "; } cout<<endl; } return 0; }
Information
- ID
- 77
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 145
- Accepted
- 44
- Uploaded By