论坛1.2 ;n阶 幻方；

#include <iostream>using namespace std;int arr[100][100];int i,j;int prei,prej;void print(int n){for(int k1=1;k1<=n;k1++){for(int k2=1;k2<=n;k2++){arr[k1][k2]=-1;}}i=1;j=(n+1)/2;for(int k3=1;k3<=n*n;k3++){arr[i][j]=k3;prei=i;prej=j;if((i-1)==0){i=n;}else{i=i-1;}if(j+1==n+1){j=1;}else{j=j+1;}if(prei==1&&prej==n||arr[i][j]!=-1){i=prei+1;j=prej;}}for(int k1=1;k1<=n;k1++){for(int k2=1;k2<=n;k2++){cout<<arr[k1][k2]<<" ";}cout<<endl;}}void main(){print(5);}