Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 5;
a = [3 3 3 3 3;
3 2 2 2 3;
3 2 1 2 3;
3 2 2 2 3;
3 3 3 3 3];
assert(isequal(bullseye(n),a));
|
2 | Pass |
n = 7;
a = [4 4 4 4 4 4 4;
4 3 3 3 3 3 4;
4 3 2 2 2 3 4;
4 3 2 1 2 3 4;
4 3 2 2 2 3 4;
4 3 3 3 3 3 4;
4 4 4 4 4 4 4];
assert(isequal(bullseye(n),a))
|
Find the alphabetic word product
1997 Solvers
It dseon't mettar waht oedrr the lrettes in a wrod are.
494 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
The sum of the numbers in the vector
342 Solvers
386 Solvers