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)))
ans =
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)))
ans =
1 0 1 0
0 1 0 1
1 0 1 0
0 1 0 1
|
How long is the longest prime diagonal?
338 Solvers
250 Solvers
432 Solvers
521 Solvers
600 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!