#include "bits/stdc++.h" using namespace std; //諸機能 #pragma region MACRO #define putans(x) std::cerr << "answer: " ; cout << (x) << endl #define dputans(x) std::cerr << "answer: "; cout << setprecision(10) << (double)(x) << endl #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define RREP(i,a,n) for(int i=(int)(n-1); i>= a; i--) #define rep(i,n) REP(i,0,n) #define rrep(i,n) RREP(i,0,n) #define all(a) begin((a)),end((a)) #define mp make_pair #define exist(container, n) ((container).find((n)) != (container).end()) #define substr(s,i,l) string((s), (i), (l)) #define tos(x) (to_string((x))) #ifdef _DEBUG //ファイルからテストデータを読み込む std::ifstream ifs("data.txt"); #define put ifs >> #else //いい感じにやる #define put cin >> #endif #pragma endregion //デバッグなどの支援 #pragma region CODING_SUPPORT #define dbg(var0) { std::cerr << ( #var0 ) << "=" << ( var0 ) << endl; } #define dbg2(var0, var1) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg(var1); } #define dbg3(var0, var1, var2) { std::cerr << ( #var0 ) << "=" << ( var0 ) << ", "; dbg2(var1, var2); } #define dbgArray(a,n) {std::cerr << (#a) << "="; rep(i,n){std::cerr <<(a[i])<<",";} cerr< pii; typedef pair pss; typedef pairpis; typedef vector vs; typedef vector vi; #pragma endregion //諸々の定数(書き換える可能性ある) #pragma region CONST_VAL #define PI (2*acos(0.0)) #define EPS (1e-9) #define MOD (ll)(1e9 + 7) #define INF (ll)(1e9) #pragma endregion int main() { int n; put n; string mat[30][30]; fill(*mat, *mat + 30 * 30, "nul"); int i = 0; int j = 0; int k = 1; int turn = 0; int vx[] = { 0,1,0,-1 }; int vy[] = { 1,0,-1,0 }; auto step = [&]()->void {turn++; turn %= 4; }; mat[0][0] = "001"; while (k < n*n) { int nextx = i + vx[turn]; int nexty = j + vy[turn]; if (nextx >= n || nextx < 0) { step(); continue; } if (nexty >= n || nexty < 0) { step(); continue; } if (mat[nextx][nexty] != "nul") { step(); continue; } k++; i = nextx; j = nexty; string ks = to_string(k); string m(( 3 - ks.size() ), '0'); mat[nextx][nexty] = ( m + ks ); } rep(i, n) { rep(j, n - 1) { cout << mat[i][j] << " "; } cout << mat[i][n - 1] << endl; } END: return 0; }