幻方算法

#include <stdio.h>#define N 5void main(){

int a[N][N]={0};int i,j,k;i=N-1;j=N/2;for(k=1;k<=N*N;k++){    a[i++][j++]=k;    if(k%N==0)    {        i-=2;        j-=1;    }    else    {        i=i%N;        j=j%N;    }}for(i=0;i<N;i++){    for(j=0;j<N;j++)        printf("%02d ",a[i][j]);    printf("\n");}

}