5 solutions
-
-1
#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; }
-
-1
#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; }
-
-2
#include <bits/stdc++.h> using namespace std; const int N=25; int a[N][N]; int dy[]={1,0,-1,0}; int dx[]={0,-1,0,1}; int main() { int n,d,x,y; cin>>n; x=n; y=1; d=0; for(int i=1;i<=n*n;i++) { a[y][x]=i; x=x+dx[d]; y=y+dy[d]; if(x>n || x<1 || y>n ||y<1 || a[y][x]!=0 && i!=n*n) { x=x-dx[d]; y=y-dy[d]; d++; if(d==4)d=0; x=x+dx[d]; y=y+dy[d]; } } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cout<<a[i][j]<<" "; } cout<<endl; } return 0; }
-
-3
#include<bits/stdc++.h> using namespace std; const int N=25; int dx[]={1,0,-1,0}; int dy[]={0,-1,0,1}; int g[N][N]; int main() { int n; cin>>n; int x=1,y=n; int d=0; for(int i=1;i<=n*n;i++) { g[x][y]=i; int a=x+dx[d],b=y+dy[d]; if(a<1||a>n||b<1||b>n||g[a][b]!=0) { d++; if(d==4) d=0; a=x+dx[d],b=y+dy[d]; } x=a,y=b; } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { cout<<g[i][j]<<" "; } cout<<endl; } return 0; }
- 1
Information
- ID
- 77
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 5
- Tags
- (None)
- # Submissions
- 130
- Accepted
- 41
- Uploaded By