Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
board = [1 1 0 0 0
1 0 0 0 0
0 0 0 2 0
0 0 2 2 2
0 0 0 2 0];
moves = lights_out_12(board); % [1 1 19]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
2 | Pass |
board = [2 2 0 2 2
2 0 2 0 2
0 2 2 2 0
2 0 2 0 2
2 2 0 2 2];
moves = lights_out_12(board); % [1 5 13 21 25]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
3 | Pass |
board = [0 1 0 0 0
1 1 1 0 1
0 1 0 1 1
1 0 0 0 1
1 1 0 0 0];
moves = lights_out_12(board); % [5 5 7 7 23 23]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
4 | Pass |
board = [2 1 2 0 0
2 0 2 0 0
2 0 2 0 0
2 0 2 0 0
2 1 2 0 0];
moves = lights_out_12(board); % [6:10]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
5 | Pass |
board = [1 1 0 0 0
2 0 0 0 0
1 1 0 0 0
2 0 0 0 0
1 1 0 0 0];
moves = lights_out_12(board); % [1 1 3 3 5 5]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
6 | Pass |
board = [0 2 0 2 0
2 2 0 2 2
0 0 2 0 0
2 2 0 2 2
0 2 0 2 0];
moves = lights_out_12(board); % [7 9 13 17 19]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
7 | Pass |
board = [0 2 0 2 0
2 1 1 1 2
2 0 1 0 2
2 1 1 1 2
0 2 0 2 0];
moves = lights_out_12(board); % [7:9 17:19]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
8 | Pass |
board = [0 0 0 0 0
0 2 1 2 0
2 0 2 0 2
0 2 1 2 0
0 0 0 0 0];
moves = lights_out_12(board); % [8 13 13 18]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
9 | Pass |
board = [0 1 1 1 0
1 2 0 2 1
0 1 1 1 0
0 0 0 0 0
0 0 0 0 0];
moves = lights_out_12(board); % [7 7 12 12 17 17]
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
10 | Pass |
board = [0 0 0 1 2
0 0 2 2 1
0 1 0 2 2
0 1 1 2 2
2 0 0 0 2];
moves = lights_out_12(board); % on your own
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
11 | Pass |
board = [0 2 1 0 0
2 2 0 0 0
1 0 0 0 0
0 0 0 0 0
0 0 0 0 0];
moves = lights_out_12(board);
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
12 | Pass |
board = [1 1 1 0 0
0 0 0 0 0
2 1 1 0 0
2 0 0 2 0
0 1 1 2 0];
moves = lights_out_12(board);
b1 = diag(ones(1,5),0) + diag(ones(1,4),1) + diag(ones(1,4),-1); b2 = eye(5); b3 = zeros(5);
b_map = [b1,b2,b3,b3,b3;b2,b1,b2,b3,b3;b3,b2,b1,b2,b3;b3,b3,b2,b1,b2;b3,b3,b3,b2,b1];
for i = 1:numel(moves)
board = mod(board + reshape(b_map(moves(i),:),[5,5]),3); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
|
Find all elements less than 0 or greater than 10 and replace them with NaN
13046 Solvers
1836 Solvers
Longest run of consecutive numbers
1648 Solvers
Given a window, how many subsets of a vector sum positive
742 Solvers
231 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!