#include <cstdio>
using namespace std;
int n;
const int max_size = 1 << 10;
int res[max_size][max_size];
void recursive(int x, int y, int n, int t) {
if (n == 0) {
res[x][y] = ?;
return;
}
int step = 1 << (n - 1);
recursive(?, n - 1, t);
recursive(x, y + step, n - 1, t);
recursive(x + step, y, n - 1, t);
recursive(?, n - 1, !t);
}
int main() {
scanf("%d", &n);
recursive(0, 0, ?);
int size = ?;
for (int i = 0; i < size; i++) {
for (int j = 0; j < size; j++)
printf("%d", res[i][j]);
puts("");
}
return 0;
}
①处应填()
②处应填()
③处应填()
④处应填()
⑤处应填()
1.
A. n%2
B. 0
C. t
D. 1
2.
A. x-step,y-step
B. x,y-step
C. x-step,y
D. x,y
3.
A. x-step,y-step
B. x+step,y+step
C. x-step,y
D. x,y-step
4.
A. n-1,n%2
B. n,0
C. n,n%2
D. n-1,0
5.
A. 1<<(n+1)
B. 1<<n
C. n+1
D. 1<<(n-1)
答案:1.C,2.D,3.B,4.B,5.B。