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

const int n = 100;

int t[n][n];

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    mt19937 gen(2345234523);

    uniform_int_distribution<int> dist(0, 20);

    //ofstream outfile("mig2.txt");

    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            if (j % 2 == 1) {
                t[i][j] = 1;
            } else {
                t[i][j] = 0;
            }
        }
    }

    swap(t[0][0], t[0][1]);

    for (int i = 3; i < n; i += 2) {
        t[0][i] = 0;
    }

    for (int i = 2; i < n; i += 2) {
        t[n - 1][i] = 1;
    }




    for (int i = 0; i < n; i ++) {
        for (int j = 0; j < n; j ++) {
            //outfile << t[i][j];
            cout << t[i][j];
        }
        //outfile << "\n";
        cout << "\n";
    }

    //outfile.close();
    return 0;
}