eolymp
bolt
Try our new interface for solving problems
Problems

Spiral

published at 1/27/24, 5:55:54 pm

include <bits/stdc++.h>

define ll long long

using namespace std; int main() { ll n,m=1; cin>>n; ll a[n][n]; if(n%2!=0) { a[(n/2)][(n/2)]=(n*n);
} for(ll i=0;i<(n/2);i++) { for(ll j=i;j<(n-i);j++) {
a[i][j]=m; m++; } for(ll j=1;j<(n-i-i);j++) {
a[(j+i)][(n-i)-1]=m;
m++; } for(ll j=(n-2)-i;j>=i;j--) { a[(n-i)-1][(j)]=m;
m++; } for(ll j=((n-i)-2);j>i;j--) { a[j][i]=m; m++; } } for(ll i=0;i<n;i++) { for(ll j=0;j<n-1;j++) { cout<<a[i][j]<<" "; } cout<<a[i][n-1]<<endl; } return 0; }