【NOIP】提高组2015 神奇的幻方

【算法】模拟

#include<cstdio>
const int maxn=;
int n,a[maxn][maxn];
int main()
{
    scanf("%d",&n);
    int x=,y=n/+;
    a[x][y]=;
    for(int i=;i<=n*n;i++)
     {
         if(x==&&y!=n)x=n,y=y+;else
         if(x!=&&y==n)x=x-,y=;else
         if(x==&&y==n)x=,y=n;else
         if(x!=&&y!=n)
          if(a[x-][y+])x=x+;
           else x=x-,y=y+;
         a[x][y]=i;
//         printf("[%d]%d %d\n",i,x,y);
     }
    for(int i=;i<=n;i++)
     {
         for(int j=;j<n;j++)printf("%d ",a[i][j]);
         printf("%d\n",a[i][n]);
     }
    return ;
}