魈的题解

#include <bits/stdc++.h>
using namespace std;
int a[105][105];
int main(){
int n;
cin>>n;
int num = 1;
int begin = 1;
int end= n;
while(begin < end)
{
for(int i=begin;i<=end;i++)
{
a[begin][i]=num;
num++;
}
for(int i=begin+1;i<=end;i++)
{
a[i][end] =num;
num++;
}
for(int i=end-1;i>=begin;i--)
{
a[end][i] =num;
num++;
}
for(int i = end-1;i>=begin+1;i--)
{
a[i][begin]=num;
num++;
}
begin++;
end--;
}
if(n%2==1){
a[n/2+1][n/2+1] = num;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
{
cout<<a[i][j]<<" ";
}
cout<<endl;
}
return 0;
}