一个题解

#include <bits/stdc++.h>
using namespace std;
const int N = 1001;
int n,a[N][N],m;
int main()
{
	cin>>n;
	int x=1,y=(n/2)+1;
	for(int i=1;i<=n*n;++i)
	{
		a[x][y]=i;
		if(x==1 and y!=n)
		{
			x=n;
			y++;
		}
		else if(y==n and x!=1)
		{
			y=1;
			x--;
		}
		else if(x==1 and y==n)
		{
			x++;
		}
		else if(x!=1 and y!=n and a[x-1][y+1]==0)
		{
			x--;
			y++;
		}
		else x++;
	}
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;j++){
			cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
}