提出 #35357489

---

ソースコード 拡げる

#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int M=1010;
int n,a[1010][1010];
vector<int> v[2];
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	n=read();
	if (n==3){
		cout<<"1 9 5\n3 6 4\n7 8 2\n";
		return 0;
	}
	if (n==4){
		cout<<"15 11 16 12\n13 3 6 9\n14 7 8 1\n4 2 10 5\n";
		return 0;
	}
	if (n==5){
		cout<<"25 23 21 19 17\n15 7 9 11 13\n5 3 1 14 12\n20 22 24 2 4\n6 8 10 16 18\n";
		return 0;
	}
	F(i,1,n*n){
		v[i&1].pb(i);
	}
	sort(v[0].begin(),v[0].end(),[&](int x,int y){
		return x%3>y%3;
	});
	sort(v[1].begin(),v[1].end(),[&](int x,int y){
		return x%3>y%3;
	});
	int x=1,y=0;
	for (int z:v[1]){
		y++;
		if (y>n) y-=n,x++;
		a[x][y]=z;
	}
	x=n; y=n+1;
	for (int z:v[0]){
		y--;
		if (y<1) y+=n,x--;
		a[x][y]=z;
	}
	F(i,1,n){
		F(j,1,n){
			cout<<a[i][j]<<" ";
		}
		cout<<"\n";
	}
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/

提出情報

ジャッジ結果