偶数幻方

#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
#define fr(i,a,b) for(int i=a,i_end=b;i<=i_end;i++)
#define mem(a,x) memset(a,x,sizeof(x))
#define fd(i,a,b) for(int i=a,i_end=b;i>=i_end;i--)
int n,f[60][60],p[60][60];
int main(){
    freopen("lock.in","r",stdin);
    freopen("lock.out","w",stdout);
    cin>>n;
    fr(i,1,n)
        fr(j,1,n)
            f[i][j]=i*n+j-n;
    fr(i,1,n){
        p[i][i]=1;
        p[i][n-i+1]=1;
    }
    fr(i,1,n)
        fr(j,1,n/2)
            if(!p[i][j])swap(f[i][j],f[i][n-j+1]);
    fr(i,1,n/2)
        fr(j,1,n)
            if(!p[i][j])swap(f[i][j],f[n-i+1][j]);
    fr(i,1,n)
        fr(j,1,n)
            printf("%d%c",f[i][j],j==n?'\n':' ');
    return 0;
}