codeforces 710C Magic Odd Square

Find an n × n matrix with different numbers from 1 to n2, so the sum in each row, column and both main diagonals are odd.

Input

The only line contains odd integer n (1 ≤ n ≤ 49).

Output

Print n lines with n integers. All the integers should be different and from 1 to n2. The sum in each row, column and both main diagonals should be odd.

幻方是指横竖斜的和相同的，和恰巧也是奇数，那就是幻方了；

AC代码：

 

# include <stdio.h>
# include <string.h>
int g[50][50];
int main(){
	int i, j, k, n, x, y, r, c;
	memset(g, 0, sizeof(g));
	scanf("%d", &n);
	r=1; c=(1+n)/2;
	g[1][c]=1;
	
	for(i=2; i<=n*n; i++){
		x=r;y=c;
		x=x-1;
		if(x<1){
			x=n;
		}
		y=y+1;
		if(y>n){
			y=1;
		}
		if(g[x][y]){
			g[r+1][c]=i;
			r=r+1;
		}
		else{
			g[x][y]=i;
			r=x;c=y;
		}
	}
	for(i=1; i<=n; i++){
		for(j=1; j<=n; j++){
			if(j!=n)
			printf("%d ", g[i][j]);
			else{
				printf("%d\n", g[i][j]);
			}
		}
		
	}
	return 0;
}