Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
x = 1;
y_correct = 1;
assert(isequal(which_doors_open(x),y_correct))
doors =
0
y =
1
|
2 | Pass |
%%
x = 3;
y_correct = 1;
assert(isequal(which_doors_open(x),y_correct))
doors =
0 0 0
y =
1
|
3 | Pass |
%%
x = 100;
y_correct = [1 4 9 16 25 36 49 64 81 100];
assert(isequal(which_doors_open(x),y_correct))
doors =
Columns 1 through 10
0 0 0 0 0 0 0 0 0 0
Columns 11 through 20
0 0 0 0 0 0 0 0 0 0
Columns 21 through 30
0 0 0 0 0 0 0 0 0 0
Columns 31 through 40
0 0 0 0 0 0 0 0 0 0
Columns 41 through 50
0 0 0 0 0 0 0 0 0 0
Columns 51 through 60
0 0 0 0 0 0 0 0 0 0
Columns 61 through 70
0 0 0 0 0 0 0 0 0 0
Columns 71 through 80
0 0 0 0 0 0 0 0 0 0
Columns 81 through 90
0 0 0 0 0 0 0 0 0 0
Columns 91 through 100
0 0 0 0 0 0 0 0 0 0
y =
1 4 9 16 25 36 49 64 81 100
|
17161 Solvers
2518 Solvers
Find perfect placement of non-rotating dominoes (easier)
228 Solvers
Matrix indexing with two vectors of indices
408 Solvers
Sum the elements in either diagonal of a square matrix
145 Solvers