【4N魔方阵】

 

 

/*
4N魔方阵 
*/

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

#define N 8

int main(void){
    int i, j;
    int square[N+1][N+1] = {0};
    
    for(j = 1; j <= N; j++){
        for(i = 1; i <= N; i++){
            if(j%4 == i%4 || (j%4 + i%4) == 1){
                square[i][j] = (N+1-i) * N -j + 1;
            }else{
                square[i][j] = (i-1) * N + j;
            }
        }
    }
    
    for(i = 1; i <= N; i++){
        for(j = 1; j<= N; j++){
            printf("%2d ", square[i][j]);
        }
        printf("\n");
    }
    
    return 0;
} 

 

运行结果:

 

posted @ 2017-02-12 12:03  天秤libra  阅读(863)  评论(0编辑  收藏