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
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
#include<bits/stdc++.h>
bool Mbg;
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define siz(vec) (int)((vec).size())
#define all(vec) (vec).begin(),(vec).end()
template<class T>
void operator +=(vec<T> &lhs,const T &rhs){lhs.push_back(rhs);}
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(expr) if(expr)continue;
#define stop(expr) if(expr)break;
#define ret(expr) if(expr)return;
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define ins insert
#define era erase
#define lb lower_bound
#define ub upper_bound
#define int long long
#define inf (long long)(1e18)
template<class T>
bool Min(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>
bool Max(T &x,const T &y){return x<y?x=y,1:0;}
const int mod=998244353;
void Add(int &x,const int &y){x=x+y<mod?x+y:x+y-mod;}
void Dec(int &x,const int &y){x=x>=y?x-y:x-y+mod;}
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,x=1ll*x*x%mod)if(y&1)ans=1ll*x*ans%mod;return ans;
}

const int n=100;
bool a[110][110],b[110][110];
#define ull unsigned long long
map<int,ull> f;
void chk(){
    int T=0;
    while(1){
        ++T;
        auto chk=[&](int x,int y){
            if(x&&y&&x<n&&y<n){
                if(a[x][y]&&a[x+1][y+1]&&!a[x][y+1]&&!a[x+1][y])return 1;
                if(!a[x][y]&&!a[x+1][y+1]&&a[x][y+1]&&a[x+1][y])return 1;
            }
            return 0;
        };
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                if(chk(i,j)||chk(i-1,j)||chk(i,j-1)||chk(i-1,j-1)){
                    b[i][j]=a[i][j]^1;
                }else{
                    b[i][j]=a[i][j];
                }
            }
        }
        ull hsh=0;
        for(int i=1;i<=n;i++){
            for(int j=1;j<=n;j++){
                a[i][j]=b[i][j];
                hsh=hsh*127+a[i][j];
            }
        }
        if(f[hsh])break;
        f[hsh]=1;
    }
    debl(T);
}
void work(){
    a[1][1]=1;
    for(int i=2;i<=n;i++){
        if(~i&1){
            for(int j=2;j<=n;j++){
                a[i][j]=1;
            }
        }else{
            a[i][n]=1;
            // for(int j=1;j<n;j++){
                // a[i][j]=1;
            // }
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++){
            cout<<a[i][j];
        }
        cout<<'\n';
    }
    // chk();
}
bool Med;
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
    // cerr<<"Time: "<<clock()<<" ms;\n";
    // cerr<<"Memory: "<<abs(&Med-&Mbg)/1024.0/1024.0<<" MiB.\n";
}
/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/