[NOIP 2015] Day.1 T1 神奇的幻方 [模拟]
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int n;
const int maxn = 50;
int a[maxn][maxn];
int cnt = 0;
void
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int n;
const int maxn = 50;
int a[maxn][maxn];
int cnt = 0;
void