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
#include<bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define mod 998244353
#define ll long long
#define inf 0x3f3f3f3f
#define INF 0x3f3f3f3f3f3f3f3f
inline int read()
{
	char ch=getchar(); int nega=1; while(!isdigit(ch)) {if(ch=='-') nega=-1; ch=getchar();}
	int ans=0; while(isdigit(ch)) {ans=ans*10+ch-48;ch=getchar();}
	if(nega==-1) return -ans;
	return ans;
}
void print(vector<int> x){for(int i=0;i<(int)x.size();i++) printf("%d%c",x[i]," \n"[i==(int)x.size()-1]);}
int a[105][105];
signed main()
{
	int n=100;
	a[1][1]=1;
	for(int j=2;j<=n;j+=2) for(int i=2;i<=n;i++) a[j][i]=1;
	// for(int i=4;i<=n;i+=2) a[i][1]=1;
	for(int i=3;i<=n;i+=2) a[i][n]=1;
	for(int i=1;i<=100;i++)
	{
		for(int j=1;j<=100;j++) printf("%d",a[i][j]);
		cout<<"\n";
	}
	return 0;
}