nyoj-734-奇数阶魔方

#include<stdio.h>
#include<string.h>
int a[20][20];
int main()
{
    int s,n,i,j,t;
    scanf("%d",&s);
    while(s--)
    {
        scanf("%d",&n);
        memset(a,0,sizeof(a));
        a[0][n/2]=1;
        t=2;
        i=n-1;
        j=n/2+1;
        while(t<=n*n)
        {
            if(i==0&&j!=n-1&&a[i][j]==0)
            {
                a[i][j]=t++;
                i=n-1;
                j++;
            }
            else if(i==0&&j==n-1&&a[i][j]==0)
            {
                a[i][j]=t++;
                i++;
            }
            else if(j==n-1&&i!=0&&a[i][j]==0)
            {
                a[i][j]=t++;
                i--;
                j=0;
            }
            else if(i==n-1&&j!=n-1&&a[i][j]==0)
            {
                a[i][j]=t++;
                i--;
                j++;
            }
            else if(j==0&&i!=n-2&&a[i][j]==0)
            {
                a[i][j]=t++;
                j++;
                i--;
            }
            else if(i==n-2&&j==0&&a[i][j]==0)
            {
                a[i][j]=t++;
                i++;
            }
            else if(a[i][j]==0)
            {
                a[i][j]=t++;
                i--;
                j++;
            }
            else
            {
                i+=2;
                j--;
            }
        }
        for(i=0;i<n;i++)
        {
            for(j=0;j<n;j++)
            printf("%4d",a[i][j]);
            printf("\n");
        }
    }
    return 0;
}