找规律

#include<bits/stdc++.h>
using namespace std;
int a[110][110];
int main(){
int n;
cin>>n;
int top=1,bottom=n,right=n,left=1,num=1;
while(top<=bottom&&left<=right){
for(int i=left;i<=right;i++)
a[top][i]=num++;
top++;
for(int i=top;i<=bottom;i++)
a[i][right]=num++;
right--;
for(int i=right;i>=left;i--)
a[bottom][i]=num++;
bottom--;
for(int i=bottom;i>=top;i--)
a[i][left]=num++;
left++;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}