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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>

using namespace std;

#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define ALL(x) begin(x), end(x)
#define SZ(x) (int)(x).size()
#define st first
#define nd second
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;

#ifdef LOCAL
#define DTP(x, y)                                    \
    auto operator<<(auto &o, auto a)->decltype(y, o) \
    {                                                \
        o << "(";                                    \
        x;                                           \
        return o << ")";                             \
    }
DTP(o << a.first << ", " << a.second, a.second);
DTP(for (auto i : a) o << i << ", ", ALL(a));
void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; }
#define debug(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x)
#else
#define debug(...) 42
#endif

void next(vector<vi> &V, int n)
{
    vector<vi> cnt(n, vi(n, 0));
    for (int i = 0; i < n - 1; i++)
        for (int j = 0; j < n - 1; j++)
            if (V[i][j] + V[i + 1][j] + V[i][j + 1] + V[i + 1][j + 1] == 2)
            {
                cnt[i][j] = 1;
                cnt[i + 1][j] = 1;
                cnt[i + 1][j + 1] = 1;
                cnt[i][j + 1] = 1;
            }
    for (int i = 0; i < n; i++)
        for (int j = 0; j < n; j++)
            if (cnt[i][j])
                V[i][j] = 1 - V[i][j];
}

void solve()
{
    int n = 100;
    // cin >> n;
    srand(time(NULL));
    int cnt = 0;
    vector<vi> V(n, vi(n, 0));
    V[0][1] = 1;
    for (int i = 1; i < n; i++)
        V[i][0] = 1;
    for (int i = 2; i < n; i++)
        if (i & 1)
            V[0][i] = 1;
        else
            V.back()[i] = 1;
    for (auto &a : V)
    {
        for (auto &b : a)
            cout << b;
        cout << endl;
    }
}

main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int Z = 1;
    // cin >> Z;
    while (Z--)
        solve();
}