#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define vi vector<int>
#define ll long long
#define SZ(x) int((x).size())
#define DBG(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define fi first
#define se second
int t[111][111];
int main() {
int n = 100;
FOR(i,n) FOR(j,n) t[i][j] = i%2;
FOR(i,n) {
t[i][0] = 0;
t[i][n-1] = 1;
}
t[0][0] = 1;
t[0][n-1] = 0;
FOR(i,n) {
FOR(j,n) printf("%d", t[i][j]);
printf("\n");
}
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 | #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define pii pair<int,int> #define vi vector<int> #define ll long long #define SZ(x) int((x).size()) #define DBG(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define fi first #define se second int t[111][111]; int main() { int n = 100; FOR(i,n) FOR(j,n) t[i][j] = i%2; FOR(i,n) { t[i][0] = 0; t[i][n-1] = 1; } t[0][0] = 1; t[0][n-1] = 0; FOR(i,n) { FOR(j,n) printf("%d", t[i][j]); printf("\n"); } return 0; } |
English