This solution is outdated. To rescore this solution, sign in.
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)))
b =
3
|
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)))
b =
2
|
1600 Solvers
The Goldbach Conjecture, Part 2
1284 Solvers
Cell Counting: How Many Draws?
581 Solvers
462 Solvers
443 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!