1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
/*
 * Opis: Główny nagłówek
 */
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

constexpr int N = 100;

int main() {
	cin.tie(0)->sync_with_stdio(0);
	array<string, N> arr;
	REP(i, N) {
		REP(j, N) {
			arr[i] += '0';
		}
	}

	

	arr[0][0] = '0';
	arr[1][0] = '1';
	
	FOR(i, 1, N-1) {
		arr[0][i] = '1';
	}
	
	FOR(i, 1, N-1) {
		arr[i][0] = '1';
		arr[i][N-1] = '0';
	}
	FOR(i, 1, N-1) {
		FOR(j, 1, N-2) {
			if (i % 2 == 0) {
				arr[i][j] = '1';
			}
			else {
				arr[i][j] = '0';
			}
		}
	}

	/*
	FOR(i, 1, N-1) {
		arr[0][i] = '1';
		arr[1][i] = '0';
	}
	FOR(i, 2, N-1) {
		arr[i][N-2] = '0';
		arr[i][N-1] = '1';
	}
	FOR(i, 0, N-3) {
		arr[N-1][i] = '1';
		arr[N-2][i] = '0';
	}
*/
	REP(i, N) {
		cout << arr[i] << "\n";
	}

}