【2(2N+1)魔方阵 】

/*
2(2N+1)魔方阵
*/

#include<stdio.h>
#include<stdlib.h>

#define N 6
#define SWAP(x, y) {int t; t = x; x = y; y = t;}

void magic_o(int [][N], int);
void exchange(int [][N], int);

int main(void){
    int square[N][N] = {};
    int i, j;
    magic_o(square, N/);
    exchange(square, N);

    for(i = ; i < N; i++){
        for( j = ; j < N; j++){
            printf("%2d ", square[i][j]);
        }
        putchar('\n');
    }
    return ;
}

void magic_o(int square[][N], int n){
    int count, row, column;
    row = ;
    column = n /;

    for(count = ; count <= n*n; count++){
        square[row][column] = count;
        square[row+n][column+n] = count + n*n;
        square[row][column+n] = count + *n*n;
        square[row+n][column] = count + *n*n;
        if(count % n == ){
            row++;
        }else{
            row = (row == ) ? n -  : row - ;
            column = (column == n - ) ?  : column + ;
        }
    }
}

void exchange(int x[][N], int n){
    int i, j;
    int m = n / ;
    int m1 = m - ;

    for(i = ; i < n/; i++){
        if(i != m){
            for(j = ; j < m; j++){
                SWAP(x[i][j], x[n/+i][j]);
            }
            for(j = ; j < m1; j++){
                SWAP(x[i][n--j], x[n/+i][n--j]);
            }
        }else{
            for(j = ; j <= m; j++){
                SWAP(x[m][j], x[n/+m][j]);
            }
            for(j = ; j <= m1; j++){
                SWAP(x[m][n--j], x[n/+m][n--j]);
            }
        }
    }
}

运行结果：