洛谷 P2615 神奇的幻方

解法一
解法二
我的垃圾代码

#include<bits/stdc++.h>

#define vint vector<int>
#define vstr vector<string>
#define vll vector<long long>
#define ll long long
#define ull unsigned long long
#define pf printf
#define sf scanf
#define sfd(n) scanf("%d", &n)
#define sfc(n) scanf("%c", &n)
#define sflf(n) scanf("%lf", &n)
#define sfll(n) scanf("%lld", &n)
#define pfd(n) printf("%d", n)
#define pfc(n) printf("%c", n)
#define pflf(n) printf("%lf", n)
#define pfll(n) printf("%lld", n)
#define pft	printf("\t")
#define pfn printf("\n")
#define pfk printf(" ")
#define PI 3.1415926
#define MAX 100000
#define MOD ((long long)1e9+7)

using namespace std;

struct num {
	int x;
	int y;
	int data;
};

int main() {
//	FILE *fin, *fout;
//	fin = fopen("data.in", "rb");
//	fout = fopen("data.out", "wb");
//	int cnt = 0, ans = 0;
//	for( int i=1; i<=MAX; i++ ) {
//		if( F(i) ) {
//			fprintf(fout, "%d, ", i);
//			ans += i;
//			cnt++;
//			if( ans>=100000 ) {
//				break;
//			}
//		}
//		
//	}
//	pfd(cnt);
	int n;
	cin >> n;
	int a = n*n;
	num* m = new num[a+1];
	for( int i=1; i<=a; i++ ) {
		m[i].x = 0;
		m[i].y = 0;
		m[i].data = 0;
	}
	m[1].x = 1;
	m[1].y = n/2+1;
	m[1].data = 1;
	for( int i=2; i<=a; i++ ) {
		if( m[i-1].x==1 ) {
			if( m[i-1].y==n ) {
				m[i].x = 2;
				m[i].y = n;
			}else {
				m[i].x = n;
				m[i].y = m[i-1].y+1;
			}
		}else {
			if( m[i-1].y==n ) {
				m[i].x = m[i-1].x-1;
				m[i].y = 1;
			}else {
				int j;
				int x1 = m[i-1].x-1, y1 = m[i-1].y+1;
				if( !(x1>0&&x1<=n&&y1>0&&y1<=n) ) {
					m[i].x = m[i-1].x+1;
					m[i].y = m[i-1].y;
				}else {
					for( j=1; j<i-1; j++ ) {
						if( m[j].x==x1&&m[j].y==y1) {
							m[i].x = m[i-1].x+1;
							m[i].y = m[i-1].y;
							break;
						}
					}
					if( j>=i-1 ) {
						m[i].x = m[i-1].x-1;
						m[i].y = m[i-1].y+1;
					}
				}
			}
		}
		m[i].data = i;
//		cout << "i = " << i << " x = " << m[i].x << " y = " << m[i].y << endl;
	}
	sort(m+1, m+a+1, [](num q, num p) {
		return q.x<p.x;
		
	});
	int z = 1;
	for( int i=0; i<n; i++ ) {
		sort(m+z, m+n+z, [](num q, num p) {
			return q.y<p.y;
		});
		for( int j=0; j<n; j++ ) {
			pfd(m[z++].data);
//			cout << " **" << m[z-1].x << " " << m[z-1].y << "** ";
			if( j<n-1 ) {
				pfk;
			}
		}
		if( i<n-1 ) {
			pfn;
		}
	}

	return 0;
}