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<iostream>

using namespace std;

const int N = 100;

int SCREEN[N][N];

void attempt2() {
	
	int size = 2;
	int mx = (N + size) / 2 - 1;
	int mn = (N - size) / 2;
	
	SCREEN[mn][mn] = 0;
	SCREEN[mx][mx] = 0;
	SCREEN[mn][mx] = 1;
	SCREEN[mx][mn] = 1;
	
	size += 2;
	
	while (size <= N) {
		int mx = (N + size) / 2 - 1;
		int mn = (N - size) / 2;
		
		for (int i = mn; i < mx; i++) {
			SCREEN[mn][i] = 0;
		}
		
		for (int i = mn; i < mx - 1; i++) {
			SCREEN[i][mx] = 1;
		}
		
		SCREEN[mx][mx-1] = 0;
		
		for (int i = mn + 1; i <= mx; i++) {
			SCREEN[mx][i] = 0;
			SCREEN[i][mn] = 1;
		}
		
		size += 2;
	}
}

void print() {
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < N; j++) {
			cout << SCREEN[i][j];
		}
		cout << "\n";
	}
}

int main() {

	attempt2();
	print();
	
}