Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 5;
a = [1 0 1 0 1;
0 1 0 1 0;
1 0 1 0 1;
0 1 0 1 0;
1 0 1 0 1];
assert(isequal(a,checkerboard(n)))
a =
1 0 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 1 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 1
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 1 1 1 1
1 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 0 1 1 1
1 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 0 1 0 1
1 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 0 1 0 1
0 1 1 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 0 1 0 1
0 1 0 1 1
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 0 1 0 1
0 1 0 1 0
1 1 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 0 1 0 1
0 1 0 1 0
1 0 1 1 1
a =
1 0 1 0 1
0 1 0 1 0
1 0 1 0 1
0 1 0 1 0
1 0 1 0 1
|
2 | Pass |
n = 4;
a = [1 0 1 0;
0 1 0 1;
1 0 1 0;
0 1 0 1];
assert(isequal(a,checkerboard(n)))
a =
1 0 1 1
1 1 1 1
1 1 1 1
1 1 1 1
a =
1 0 1 0
1 1 1 1
1 1 1 1
1 1 1 1
a =
1 0 1 0
0 1 1 1
1 1 1 1
1 1 1 1
a =
1 0 1 0
0 1 0 1
1 1 1 1
1 1 1 1
a =
1 0 1 0
0 1 0 1
1 0 1 1
1 1 1 1
a =
1 0 1 0
0 1 0 1
1 0 1 0
1 1 1 1
a =
1 0 1 0
0 1 0 1
1 0 1 0
0 1 1 1
a =
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
|
3 | Pass |
n = 7;
a = [1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1];
assert(isequal(a,checkerboard(n)))
a =
1 0 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 1 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 1 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 1 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
1 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 1 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 1 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 1
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 1 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 1 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 1 1
a =
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
0 1 0 1 0 1 0
1 0 1 0 1 0 1
|
Who knows the last digit of pi?
488 Solvers
205 Solvers
Create a vector whose elements depend on the previous element
290 Solvers
Sum the numbers on the main diagonal
375 Solvers
216 Solvers