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

const int N = 1e2;

int n = 100, tab[N+1][N+1];

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

    for(int i = 1 ; i <= n ; i++) {
        for(int j = 1 ; j <= n ; j++) {
            cout<<tab[i][j]<<"";
        }
        cout<<"\n";
    }
}