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
#include <algorithm>
#include <cstdio>

#define REP(a, n) for (int a = 0; a<(n); ++a)
#define FOR(a, b, c) for (int a = (b); a<=(c); ++a)

typedef long long LL;

using namespace std;

//////////////

int N, C;

int tab[100][100];

int main() {
    REP(y, 100) {
        REP(x, 100)
            tab[y][x] = y%2;
        int x = (y%2 || !y) ? 0 : 99;
        tab[y][x] = 1-tab[y][x];
        REP(x, 100)
            printf("%d", tab[y][x]);
        printf("\n");
    }
}