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

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

    int n=100;

    vector<vector<int>> grid(n,vector<int>(n,1));

    grid[0][0]=0;
    grid[1][0]=0;
    grid[2][0]=0;
    grid[3][1]=0;

    for(int i=2;i<n;i++){
        if(i%2==0)grid[0][i]=0;
        else grid[3][i]=0;
    }

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

    for(int i=0;i<n;i++){
        for(int j=0;j<n;j++)cout<<grid[i][j];
        cout<<endl;
    }

    return 0;
}