神奇的幻方

原题链接：https://www.luogu.org/problem/show?pid=2615#sub

题目要求我们生成这个幻方，那么我们只需要模拟一下这个幻方的形成过程就好，非常简单的一道模拟。

AC代码：

#include<iostream>
#define maxn 41
#define check cout << "ok" << endl;
using namespace std;
int a[maxn][maxn];
int n;
int get_hf_line(int x){
    int ans = -1;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++){
            if (a[i][j] == x)
                ans = i;
        }
    return ans;
}

int get_hf_column(int x){
    int ans = -1;
    for (int i=1;i<=n;i++)
        for (int j=1;j<=n;j++)
            if (a[i][j] == x)
                ans = j;
    return ans;
}


int main(){
    cin >> n;
    int mid = n/2 + 1; 
    a[1][mid] = 1;
    for (int k=2;k<=n*n;k++){
        int kx = get_hf_line(k-1);
        int ky = get_hf_column(k-1);

        //judge
        if (kx == 1 && ky != n)
            a[n][ky+1] = k;

        if (ky == n && kx !=1)
            a[kx-1][1] = k;

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

        if (kx != 1 && ky != n){
            if (a[kx-1][ky+1] == 0)
                a[kx-1][ky+1] = k;
            else
                a[kx+1][ky] = k;
        }
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++)
            printf("%d ",a[i][j]);
        cout << endl;
    }
    return 0;
}