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)))
|
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)))
|
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)))
|
The Goldbach Conjecture, Part 2
1285 Solvers
3375 Solvers
262 Solvers
461 Solvers
Calculate Amount of Cake Frosting
7526 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!