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

using namespace std;
using namespace __gnu_pbds;

#define _DEBUG
#ifdef _DEBUG
template<typename T1, typename T2> auto& operator<<(ostream& o, pair<T1, T2> a) { return o << "(" << a.first << ", " << a.second << ")"; }
template<typename T, typename OS> auto& operator<<(OS& o, T a) { o << "{"; for (auto b : a) o << b << ", "; return o << "}"; }
#define dbg(x...) cerr << "[" #x "]: ", [](auto... args) { ((cerr << args << ", "),...) << "\n"; }(x)
#else
#define dbg(...)
#endif

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define F first
#define S second

template<class T>
using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vi = vector<int>;


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

    vector<vector<int>> v(100, vector<int>(100, 0));

    for(ll i = 1 ; i < 100 ; ++i)
        v[0][i] = 1;
    for(ll i = 1 ; i < 100 ; ++i)
        v[i][0] = 1;
    for(ll i = 2 ; i < 100 ; i+=2)
        for(ll j = 0 ; j < 99 ; ++j)
            v[i][j] = 1;

    for(int j = 0 ; j < 100 ; ++j) {
        for(int i = 0 ; i < 100 ; ++i) {
            cout << v[i][j];
        }
        cout << '\n';
    }

    return 0;
}