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
//Sylwia Sapkowska 
#include <bits/stdc++.h> 
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
typedef pair<int, int> T;
const int A = 100;

void solve(){
    vector a(A, vector<int>(A));
    a[0][1] = a[0][2] = a[0][3] = 1;
    a[1][2] = 1;
    a[2][0] = a[2][1] = 1;
    a[3][0] = a[3][1] = a[3][2] = 1;
    int c = 0;
    for (int i = 4; i<A; i+=2){
        for (int j = 0; j<=i+1; j++){
            a[i][j] = c^1;
            a[i+1][j] = c^1;
            a[j][i] = c^1;
            a[j][i+1] = c^1;
        }
        a[i][0] = c;
        a[0][i+1] = c;
        for (int j = 0; j <= i; j++){
            a[i+1][j] = c;
        }
        for (int j = 0; j < i; j++){
            a[j][i] = c;
        }
        c ^= 1;
    }
    auto print = [&](){
        for (int i = 0; i<A; i++){
            for (int j = 0; j<A; j++){
                cout << a[i][j];
            }
            cout << "\n";
        }
    };
    print();
}   
 
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    solve();

    return 0;
}