CF链接:http://codeforces.com/contest/710/problem/C
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.
Examples
Input
1
Output
1
Input
3
Output
2 1 4
3 5 7
6 9 8
题意:题目要将1到n*n个不同数字放到一个n*n的方格里,并保证每行、列、主对角线之和为奇数。
由于题目要求到n为奇数,并且两奇数相乘也为奇数,则1到n*n里面的奇数总数比偶数多1。
那么idea就来了,我们做一个正方形如下:(借用该大神的图一用)
目的就是将红色方框里的都填上奇数,剩下的用偶数补齐。则为答案!!!
#include<iostream>
using namespace std;
int a[50][50];
int main()
{
int n,p=1;
cin>>n;
for(int i=1;i<=n/2;i++)
{
for(int j=n/2-i+2;j<=n-n/2+i-1;j++) //找准关系
{
a[i][j]=p;
p+=2;
}
}
for(int i=n/2+1;i<=n;i++)
{
for(int j=i-n/2;j<=n-i+n/2+1;j++)
{
a[i][j]=p;
p+=2;
}
}
p=2;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
if(a[i][j])
cout<<a[i][j]<<" ";
else
{
cout<<p<<" ";
p+=2;
}
}
cout<<endl;
}
return 0;
}