题解

#include <bits/stdc++.h>
using namespace std;
const int N=100001;
typedef long long ll;
ll n,a[101][101],y=0,x=-1;
int main(){
	cin>>n;
	int cnt=1;
	while(cnt<=n*n)
	{
		while(x+1<n and a[x+1][y]==0)
		{
			a[++x][y]=cnt++;
		}
		y=y+1;
		a[x][y]=cnt++;
		while(x-1>=0 and a[x-1][y]==0)
		{
			a[--x][y]=cnt++;
		}
		
	}
	for(int i=0;i<n;++i)
	{
		for(int j=0;j<n;++j)
		{
			cout<<a[i][j]<<" ";
		}
		cout<<endl;
	}
	return 0;
}