Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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 | Pass |
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));
|
147 Solvers
2474 Solvers
Longest run of consecutive numbers
194 Solvers
688 Solvers
Determine if input is a Narcissistic number
93 Solvers