P2615 [NOIP2015 提高组] 神奇的幻方

#include<bits/stdc++.h>
using namespace std;


int main() {

	int arry[200][200] = {0};
	int n;

	cin >> n;

	arry[1][(n + 1) / 2] = 1;//第一行中间为1

	for (int k = 2; k <= n * n; k++) {//从2到n*n

		for (int i = 1; i <= n; i++) {

			for (int j = 1; j <= n; j++) {

				if (arry[1][j] == (k - 1) && j != n)//就把题目中所有条件表示出来就行
					arry[n][j + 1] = k;

				if (arry[i][n] == (k - 1) && i != 1)
					arry[i - 1][1] = k;

				if (arry[1][n] == (k - 1))
					arry[2][n] = k;

				if(arry[1][j] != k - 1 && arry[i][n] != k - 1) {
					if (arry[i][j] == k - 1 && arry[i - 1][j + 1] == 0)
						arry[i - 1][j + 1] = k;
					else if (arry[i][j] == k - 1 && arry[i - 1][j + 1] != 0)
						arry[i + 1][j] = k;
				}

			}

		}

	}

	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= n; j++) {
			cout << arry[i][j] << " ";
		}
		cout << endl;
	}

	system("pause");
	return 0;
}