This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 13;
y_correct = 20;
assert(isequal(candyCount(n),y_correct))
y =
20
|
2 | Pass |
n = 24;
y_correct = 36;
assert(isequal(candyCount(n),y_correct))
y =
36
|
647 Solvers
Magic is simple (for beginners)
1110 Solvers
244 Solvers
206 Solvers
Matrix of almost all zeros, except for main diagonal
122 Solvers