洛谷P2615 神奇的幻方

#include<iostream>

using namespace std;

int m[40][40], n;

int main()
{
	cin >> n;
	int x = n / 2 + 1, y = 1;
	for (int i = 1; i <= n * n; i++)
	{
		m[x][y] = i;
		x++; y--;
		if (x > n&& y <= 0)
		{
			x--;
			y += 2;
		}
		else if (x > n) x = 1;
		else if (y <= 0) y = n;
		else if (m[x][y] != 0)
		{
			x--;
			y += 2;
		}
	}
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
			cout << m[j][i] << " ";
		cout << endl;
	}
	return 0;
}