输出“魔方阵“

#include<stdio.h>
int main()
{
  int a[15][15], i, j, k,n=0;
  //校验输入的是不是偶数或者是不是超过了15
  while ((n % 2 == 0) || (n > 15) || (n==0))
  {
    printf("输入n的值,不能是偶数,不能超过15:");
    scanf("%d", &n);
  }
  //将数组用0初始化
  for (i = 1; i <= n; i++)
    for (j = 1; j <= n; j++)
      a[i][j] = 0;
  //建立魔方阵
  i = 1; j = (n+1) / 2;
  a[i][j] = 1;
  //i表行，j表列
  for (k = 2; k <= n * n; k++)
  {
    i = i - 1;      //行减1 列加1
    j = j + 1;
    //特殊情况
    if ((i < 1) && (j > n))
    {
      i = i + 2;    //第1行第n列的元素之后的数
      j = j - 1;
    }
    else
    {
      if (i < 1)//单个行或列超出
        i = n;
      if (j > n)
        j = 1;
    }
    if (a[i][j] == 0)
      a[i][j] = k;
    else
    {
      i = i + 2;//位上有数
      j = j - 1;
      a[i][j] = k;
    }
  }
  //输出
  for (i = 1; i <= n; i++)
  {
    for (j = 1; j <= n; j++)
      printf("%5d", a[i][j]);
    printf("\n");
  }
  return 0;
}