模拟枚举专题——神奇的幻方

#include<iostream>
using namespace std;
int main(){
    int n;
    cin >> n;
    int a[40][40] = {0};
    a[0][n/2] = 1;
    for(int k = 2;k <= n*n; ++k){
        for(int i = 0;i < n; i++)
              	for (int j = 0 ; j < n; ++j){
              	  	if(a[i][j] == k-1)
				    {
              	  	  if(i == 0 && j == n-1)  a[i+1][j] = k;
              	  	  else if(i == 0 && j != n-1) a[n-1][j+1] =k;
              	  	  else if(i != 0 && j == n-1) a[i-1][0] = k;
              	  	  else 
              	  	  {
              	  	  	if(!a[i-1][j+1]) a[i-1][j+1] = k;
              	  	  	else a[i+1][j] =k;
						  }
					}
				}       	             
    }
    
    for(int i = 0;i < n ; ++i){
        for(int j = 0;j < n; ++j){
            if(j != n-1) cout << a[i][j]<<" ";
            else cout << a[i][j];
        }
        cout << endl;
    }
    
    
    
    return 0;
    
}