#include <bits/stdc++.h>
using namespace std;
#define FOR(i,p,q) for(int i=(p); i<=(q); ++i)
#define ROF(i,p,q) for(int i=(p); i>=(q); --i)
#define REP(i,q) for(int i=0; i<(q); ++i)
#define pb push_back
#define as assign
#define rz resize
#define Co const
#define all(X) X.begin(), X.end()
#define rall(X) X.rbegin(), X.rend()
#define sz(X) (int)(X.size())
#define ckmax(a,b) a=max(a,b)
#define ckmin(a,b) a=min(a,b)
#define V vector
typedef long long ll;
typedef mt19937_64 mt;
#ifndef UNCLE
typedef basic_string<bool> vb;
typedef basic_string<int> vi;
typedef basic_string<ll> vl;
#else
typedef V<bool> vb;
typedef V<int> vi;
typedef V<ll> vl;
#endif
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
// N=75'000;
// cout<<3<<" "<< N*10<<" "<<N<<" "<<N<<"\n";
// REP(i,N) cout<<1<<" "<<i<<"\n";
// REP(i,N) cout<<2<<" "<<i<<"\n";
// vi vc={6,5,4,3,2,1};
// for(int v:vc) cout<<v<<" ";
// cout<<"\n";
// sort(vc.end()-2,vc.end());
// for(int v:vc) cout<<v<<" ";
// cout<<"\n";
int N=100;
V<vb> gri(N,vb(N,0));
REP(r,N) for(int c=0;c<N;c+=2) gri[r][c]=1;
REP(c,N) gri[0][c]=0, gri[N-1][c]=1;
gri[0][0]=1;
gri[N-1][0]=0;
REP(r,N){
REP(c,N) cout<<gri[r][c];
cout<<"\n";
}
}
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 | #include <bits/stdc++.h> using namespace std; #define FOR(i,p,q) for(int i=(p); i<=(q); ++i) #define ROF(i,p,q) for(int i=(p); i>=(q); --i) #define REP(i,q) for(int i=0; i<(q); ++i) #define pb push_back #define as assign #define rz resize #define Co const #define all(X) X.begin(), X.end() #define rall(X) X.rbegin(), X.rend() #define sz(X) (int)(X.size()) #define ckmax(a,b) a=max(a,b) #define ckmin(a,b) a=min(a,b) #define V vector typedef long long ll; typedef mt19937_64 mt; #ifndef UNCLE typedef basic_string<bool> vb; typedef basic_string<int> vi; typedef basic_string<ll> vl; #else typedef V<bool> vb; typedef V<int> vi; typedef V<ll> vl; #endif int main(){ ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); // N=75'000; // cout<<3<<" "<< N*10<<" "<<N<<" "<<N<<"\n"; // REP(i,N) cout<<1<<" "<<i<<"\n"; // REP(i,N) cout<<2<<" "<<i<<"\n"; // vi vc={6,5,4,3,2,1}; // for(int v:vc) cout<<v<<" "; // cout<<"\n"; // sort(vc.end()-2,vc.end()); // for(int v:vc) cout<<v<<" "; // cout<<"\n"; int N=100; V<vb> gri(N,vb(N,0)); REP(r,N) for(int c=0;c<N;c+=2) gri[r][c]=1; REP(c,N) gri[0][c]=0, gri[N-1][c]=1; gri[0][0]=1; gri[N-1][0]=0; REP(r,N){ REP(c,N) cout<<gri[r][c]; cout<<"\n"; } } |
English