#pragma GCC optimize ("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define FOR(i, a, b) for (auto i=(a); i<(b); i++)
#define FORD(i, a, b) for (auto i=(a); i>(b); i--)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define ft first
#define sd second
#ifdef DEBUG
#include "debug.h"
#else
#define dbg(...) 0
#endif
const int n = 100;
void printRow(int domin, bool diffAtStart)
{
if (diffAtStart)
printf("%d", domin ^ 1);
FOR(i, 0, n-1)
printf("%d", domin);
if (not diffAtStart)
printf("%d", domin ^ 1);
printf("\n");
}
void solve()
{
printRow(1, true);
int diffAtStart = 1;
FOR(i, 0, n-1)
printRow(i&1, diffAtStart), diffAtStart ^= 1;
}
int main()
{
int tc = 1;
// scanf ("%d", &tc);
FOR(cid, 1, tc+1)
solve();
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 43 44 45 | #pragma GCC optimize ("Ofast") #define _USE_MATH_DEFINES #include <bits/stdc++.h> #define FOR(i, a, b) for (auto i=(a); i<(b); i++) #define FORD(i, a, b) for (auto i=(a); i>(b); i--) #define SZ(x) ((int)(x).size()) #define ALL(x) (x).begin(), (x).end() #define ft first #define sd second #ifdef DEBUG #include "debug.h" #else #define dbg(...) 0 #endif const int n = 100; void printRow(int domin, bool diffAtStart) { if (diffAtStart) printf("%d", domin ^ 1); FOR(i, 0, n-1) printf("%d", domin); if (not diffAtStart) printf("%d", domin ^ 1); printf("\n"); } void solve() { printRow(1, true); int diffAtStart = 1; FOR(i, 0, n-1) printRow(i&1, diffAtStart), diffAtStart ^= 1; } int main() { int tc = 1; // scanf ("%d", &tc); FOR(cid, 1, tc+1) solve(); return 0; } |
English