Test | Status | Code Input and Output |
---|---|---|
1 | Fail |
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_1(board); %should be [5 7 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]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
2 | Fail |
board = [1 1 0 0 0
1 0 1 0 0
0 1 1 1 0
0 0 1 0 1
0 0 0 1 1];
moves = lights_out_1(board); %should be [1 13 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]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
3 | Fail |
board = [1 0 0 0 0
0 1 0 0 0
1 1 0 0 0
0 1 0 0 0
1 0 0 0 0];
moves = lights_out_1(board); %should be [2 3 4]
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]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
4 | Fail |
board = [0 1 1 1 0
1 0 1 0 1
0 1 1 1 0
0 0 0 0 0
0 0 0 0 0];
moves = lights_out_1(board); %should be [7 12 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]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
5 | Fail |
board = [0 0 0 0 0
0 0 0 0 0
0 0 0 1 1
0 0 1 1 0
0 0 1 0 0];
moves = lights_out_1(board); %you're on your own now
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]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
6 | Fail |
board = [0 0 0 0 0
0 0 0 0 0
0 1 0 1 0
1 1 1 1 1
0 0 1 0 0];
moves = lights_out_1(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]),2); %remove semicolon to display progress
end
assert(sum(abs(board(:)))==0)
assert(numel(moves)==3)
|
Project Euler: Problem 7, Nth prime
521 Solvers
Construct an index vector from two input vectors in vectorized fashion
175 Solvers
3064 Solvers
Natural numbers in string form
347 Solvers
(Linear) Recurrence Equations - Generalised Fibonacci-like sequences
149 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!