noip2015神奇的幻方

传送门（洛谷）

大模拟，按照他这么来就行了

Code

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(register int (i)=(a);(i)<=(b);(i)++)
#define don(i,a,b) for(register int (i)=(a);(i)>=(b);(i)--)
using namespace std;
const int maxn=1e6+10;
const int maxm=1e3+10;
int mapp[maxm][maxm];
int n,nn;

template <class t> inline void read(t &x) {
	x=0;int f=1;char ch=getchar();
	while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
	while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
	x*=f;
}

void readdata() {
	memset(mapp,false,sizeof(mapp));
	read(n);
	nn=n*n;
	mapp[1][((n+1)/2)]=1;
}

void work() {
	rep(i,2,nn) {
		rep(j,1,n) {
			if(mapp[1][j]==(i-1)) {
				mapp[n][j+1]=i;
				break;
			}
			if(mapp[j][n]==(i-1) && j!=1) {
				mapp[j-1][1]=i;
				break;
			}
			if(mapp[1][n]==(i-1)) {
				mapp[2][n]=i;
				break;
			}
		}
		rep(j,1,n)
		 rep(k,1,n) {
		 	if(j!=1 && k!=n) {
		 		if(mapp[j][k]==(i-1) && mapp[j-1][k+1]==0) {
		 			mapp[j-1][k+1]=i;
		 			break;
				}
		 		if(mapp[j][k]==(i-1) && mapp[j-1][k+1]!=0)
		 		mapp[j+1][k]=i;
			 }
		 }
	}
	rep(i,1,n) 
	 rep(j,1,n) {
	 	printf("%d ",mapp[i][j]);
		if(j==n) printf("\n");
	 }
}

int main() {
	//freopen("input.txt","r",stdin);
	//freopen("output.txt","w",stdout);
	readdata();
	work();
	return 0;
}