奇数幻方

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF=0x3f3f3f3f;
const int base=131;
const int mod=1e9+7;
const int Maxn=1e6+5;
int n,sx,sy;
bool flag=true; 
int a[15][15];

void print(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            printf("%d ",a[i][j]);
        }
        printf("
");
    }
}

void dfs(int x,int y,int k){
    //cout<<"xy:"<<x<<" "<<y<<endl;
    //cout<<"k:"<<k<<endl;
    if(k==n*n+1 && flag){
        print();
        flag=false;
        return;
    }
    int dx=x-1,dy=y-1;
    if(dx>0 && dy>0 && a[dx][dy]==0){
        a[dx][dy]=k;
        dfs(dx,dy,k+1);
    }
    else if(a[dx][dy]!=0){
        a[x+1][y]=k;
        dfs(x+1,y,k+1);
    }
    else if(dx<=0 && dy<=0){
        a[x+1][y]=k;
        dfs(x+1,y,k+1);
    }
    else if(dx<=0 && dy>0){
        a[n][dy]=k;
        dfs(n,dy,k+1);    
    }
    else if(dy<=0 && dx>0){
        a[dx][n]=k;
        dfs(dx,n,k+1); 
    }
    
}

int main(){
    scanf("%d",&n);
    a[1][n/2+1]=1;
    sx=1;sy=n/2+1;
    dfs(sx,sy,2);
    return 0;
}