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

using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define st first
#define nd second
const int MAXN = 100;

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int T[MAXN][MAXN];
    rep(i, MAXN) {
        rep(j, MAXN) {
            T[i][j] = 0;
        }
    }
    T[1][0] = 1;
    for (int j = 1; j < MAXN; j++) {
        T[0][j] = 1;
    }
    for (int i = 2; i < MAXN; i++) {
        if (i % 2 == 0) {
            rep(j, MAXN - 1) {
                T[i][j] = 1;
            }
        }
        else {
            T[i][0] = 1;
        }
    }
    rep(i, MAXN) {
        rep(j, MAXN) {
            cout << T[i][j];
        }
        cout << '\n';
    }
    return 0;
}