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
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define int long long
#define pii pair<int, int>
#define fi first
#define se second

const int INF = 1e15 + 7;
const int MAXN = 1e6 + 7;




void solve(){
	
	int n = 100;
	
	for(int i = 0; i < n; i++){
		
		if(i == 0) cout << 1;
		else cout << 0;
	
		if(i == 0){
			
			for(int j = 1; j < n; j++) cout << 0;
		}
		
		else if(i%2 == 1){
			
			for(int j = 1; j < n; j++) cout << 1;
		}
		
		else {
			
			for(int j = 1; j < n - 1; j++) cout << 0;
			cout << 1;
		}
		
		cout << '\n';
	}
}

bool multi = 0;

signed main(){
	
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	
	int t = 1;
	if(multi) cin >> t;
	while(t--) solve();
	
	return 0;
}