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
#include <algorithm>
#include <cstdio>

using namespace std;

// max time: 17
// 00001
// 10111
// 10101
// 11000
// 10000

const int SIZE = 100;
const int N = SIZE, M = SIZE;

bool board[N][M];

int main() {
  pair<int, int> current_pos = {N - 1, 0};

  for (int i = SIZE - 1; i >= 3; i-=2) {
    for (int j = 0; j < i; j++) {
      board[current_pos.first][current_pos.second] = true;
      current_pos = {current_pos.first - 1, current_pos.second};
    }

    for (int j = 0; j < i; j++) {
      board[current_pos.first][current_pos.second] = false;
      current_pos = {current_pos.first, current_pos.second + 1};
    }

    for (int j = 0; j < i - 1; j++) {
      board[current_pos.first][current_pos.second] = true;
      current_pos = {current_pos.first + 1, current_pos.second};
    }

    for (int j = 0; j < i - 1; j++) {
      board[current_pos.first][current_pos.second] = false;
      current_pos = {current_pos.first, current_pos.second - 1};
    }
  }

  board[N/2 - 1][M/2 - 1] = true;
  board[N/2][M/2] = true;

  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++) {
      printf("%d", board[i][j]);
    }
    puts("");
  }

  return 0;
}