#include
#define N 15
int main()
{
int i,j,n,t,k,m,data[N][N];
printf("输入一个小于16的奇数:");
scanf("%d",&n);
for(i=0;i
{
for(j=0;j
{
data[i][j]=0;
}
}
i=0;j=n/2;data[i][j]=1;
t=2;
while(t<=n*n)
{
k=i,m=j;//记录上个数的位置
i=i-1;
j=j+1;
if(i<0) i=n-1;
if(j>n-1) j=0;
//printf("%-3d%-3d",i,j);
if(data[i][j]==0)
{
data[i][j]=t;
//printf("**%-3d%-3d%-3d\n",i,j,t);
}
else
{
i=k+1;
if(i>n-1) i=0;
j=m;
data[i][j]=t;
//printf("*%-3d%-3d%-3d\n",i,j,t);
}
t++;
}
printf("%d阶的魔方矩阵如下!\n",n);
for(i=0;i
{
for(j=0;j
{
printf("%-4d",data[i][j]);
}
printf("\n");
}
return(0);
}