#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vc vector
#define st first
#define nd second
#define pll pair<ll, ll>
#define sz(a) (ll)a.size()
#define all(a) a.begin(), a.end()
#define pu push
#define pub push_back
#define pob pop_back
#define em emplace
#define emb emplace_back
void program() {
ll n = 100;
vc<vc<ll>> a(n, vc<ll>(n, 0));
for (ll i = 0; i < n; i += 2) {
for (ll j = 0; j < n; j++)
a[i][j] = 1;
a[i + 1][0] = 1;
a[i][n - 1] = 0;
}
a[0][n - 1] = 1;
a[0][0] = a[1][1] = 0;
a[1][0] = a[0][1] = 1;
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < n; j++)
cout << a[i][j];
cout << "\n";
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
program();
return 0;
}
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 | #include <bits/stdc++.h> using namespace std; typedef long long ll; #define vc vector #define st first #define nd second #define pll pair<ll, ll> #define sz(a) (ll)a.size() #define all(a) a.begin(), a.end() #define pu push #define pub push_back #define pob pop_back #define em emplace #define emb emplace_back void program() { ll n = 100; vc<vc<ll>> a(n, vc<ll>(n, 0)); for (ll i = 0; i < n; i += 2) { for (ll j = 0; j < n; j++) a[i][j] = 1; a[i + 1][0] = 1; a[i][n - 1] = 0; } a[0][n - 1] = 1; a[0][0] = a[1][1] = 0; a[1][0] = a[0][1] = 1; for (ll i = 0; i < n; i++) { for (ll j = 0; j < n; j++) cout << a[i][j]; cout << "\n"; } } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); program(); return 0; } |
English