分析
模拟题,把每种情况翻译成代码即可
code
#include<bits/stdc++.h>
using namespace std;
#define loop(i,start,end) for(register int i=start;i<=end;++i)
#define clean(arry,num); memset(arry,num,sizeof(arry));
int n;
const int maxn=45;
int G[maxn][maxn];
inline int read()
{
int _ans=0;bool _neg=false;char _r=getchar();
while(_r>'9'||_r<'0'){if(_r=='-')_neg=true;_r=getchar();}
while(_r>='0'&&_r<='9'){_ans=_ans*10+_r-'0';_r=getchar();}
return (_neg)?-_ans:_ans;
}
inline void printG(){loop(i,1,n){loop(j,1,n)printf("%d ",G[i][j]);printf("\n");}}
int main()
{
#ifndef ONLINE_JUDGE
freopen("datain.txt","r",stdin);
#endif
clean(G,0);
n=read();int prex=1,prey=((n-1)>>1)+1;G[prex][prey]=1;
loop(i,2,n*n)
{
if(prex==1&&prey<n)prex=n,++prey,G[prex][prey]=i;
else if(prey==n&&prex>1)--prex,prey=1,G[prex][prey]=i;
else if(prex==1&&prey==n)++prex,G[prex][prey]=i;
else if(prex>1&&prey<n)
{
if(!G[prex-1][prey+1])G[--prex][++prey]=i;
else G[++prex][prey]=i;
}
}
printG();
return 0;
}