Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
board = [0 1 0 1 0
1 0 0 0 1
0 0 0 0 0
1 0 0 0 1
0 1 0 1 0];
assert(lights_out_8(board)); % [2 4 6 10 16 20 22 24]
|
2 | Fail |
board = [1 0 0 0 1
0 1 0 1 0
0 0 0 0 0
0 1 0 1 0
1 0 0 0 1];
assert(lights_out_8(board)); % [1 5 7 9 17 19 21 25]
|
3 | Fail |
board = [0 1 0 0 0
1 0 1 0 0
0 1 0 1 0
0 0 1 0 1
0 0 0 1 0];
assert(lights_out_8(board)); % [2 6 8 12 14 18 20 24]
|
4 | Fail |
board = [1 1 0 1 1
1 1 0 1 1
0 0 0 0 0
1 1 0 1 1
1 1 0 1 1];
assert(lights_out_8(board)); % [1:2 4:7 9:10 16:17 19:22 24:25]
|
5 | Fail |
board = [0 0 1 0 0
0 1 0 1 0
1 0 1 0 1
0 1 0 1 0
0 0 1 0 0];
assert(lights_out_8(board)); % [3 7 9 11 13 15 17 19 23]
|
6 | Fail |
board = [1 0 1 0 1
0 0 0 0 0
1 0 1 0 1
0 0 0 0 0
1 0 1 0 1];
assert(lights_out_8(board)); % [1 3 5 11 13 15 21 23 25]
|
7 | Fail |
board = [0 1 1 1 0
1 1 0 1 1
1 0 1 0 1
1 1 0 1 1
0 1 1 1 0];
assert(lights_out_8(board)); % [2:4 6:7 9:11 13 15:17 19:20 22:24]
|
8 | Fail |
board = [0 0 0 0 0
0 0 0 0 0
1 0 1 1 0
0 0 0 0 0
0 0 0 0 0];
assert(~lights_out_8(board)); % [1 2 3 4 5 7 9 13]
|
9 | Fail |
board = [1 0 0 0 1
0 1 1 0 0
0 1 0 0 0
0 0 0 0 0
1 0 0 0 0];
assert(~lights_out_8(board)); % [1 2 3 4 6 7 8 11 12 16]
|
10 | Fail |
board = [1 0 0 0 1
0 0 1 0 0
0 1 1 1 0
0 0 1 0 0
1 0 0 0 1];
assert(~lights_out_8(board)); % on your own
|
11 | Fail |
board = [0 0 1 0 0
0 0 1 0 0
1 1 0 1 1
0 0 1 0 0
0 0 1 0 0];
assert(~lights_out_8(board));
|
12 | Fail |
board = [1 1 0 1 1
1 0 0 0 1
0 0 0 0 0
1 0 0 0 1
1 1 0 1 1];
assert(~lights_out_8(board));
|
13 | Fail |
board = [0 1 1 0 0
0 0 1 0 0
1 1 0 1 1
0 0 0 0 1
0 1 1 0 0];
assert(~lights_out_8(board));
|
14 | Fail |
board = [0 0 1 0 0
0 1 1 1 0
1 1 0 1 1
0 1 1 1 0
0 0 1 0 0];
assert(~lights_out_8(board));
|
349 Solvers
73 Solvers
Predicting life and death of a memory-less light bulb
277 Solvers
Sums of Multiple Pairs of Triangular Numbers
203 Solvers
14 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!