This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [ ...
1 1 0 0
0 1 0 0
1 1 0 0
0 0 0 0];
B = [ ...
1 1 0 0
0 0 1 0
1 1 0 0
0 0 0 0];
assert(isequal(life(A),B))
T =
1 2 2 1
5 4 3 2
2 2 2 1
4 4 2 2
T =
1 2 2 1
0 4 3 2
2 2 2 1
4 4 2 2
T =
1 2 2 1
0 4 3 2
1 2 2 1
4 4 2 2
T =
1 2 2 1
0 4 3 2
1 2 2 1
0 4 2 2
T =
1 1 2 1
0 4 3 2
1 2 2 1
0 4 2 2
T =
1 1 2 1
0 0 3 2
1 2 2 1
0 4 2 2
T =
1 1 2 1
0 0 3 2
1 1 2 1
0 4 2 2
T =
1 1 2 1
0 0 3 2
1 1 2 1
0 0 2 2
T =
1 1 0 1
0 0 3 2
1 1 2 1
0 0 2 2
T =
1 1 0 1
0 0 1 2
1 1 2 1
0 0 2 2
T =
1 1 0 1
0 0 1 2
1 1 0 1
0 0 2 2
T =
1 1 0 1
0 0 1 2
1 1 0 1
0 0 0 2
T =
1 1 0 0
0 0 1 2
1 1 0 1
0 0 0 2
T =
1 1 0 0
0 0 1 0
1 1 0 1
0 0 0 2
T =
1 1 0 0
0 0 1 0
1 1 0 0
0 0 0 2
T =
1 1 0 0
0 0 1 0
1 1 0 0
0 0 0 0
|
2 | Pass |
%%
A = [ ...
0 1 1 0
1 1 1 0
0 0 1 0
0 0 0 0];
B = [ ...
1 0 1 1
1 0 0 0
0 0 1 1
0 1 1 0];
assert(isequal(life(A),B))
T =
1 4 3 3
2 5 4 4
2 4 2 3
1 3 3 2
T =
1 4 3 3
1 5 4 4
2 4 2 3
1 3 3 2
T =
1 4 3 3
1 5 4 4
0 4 2 3
1 3 3 2
T =
1 4 3 3
1 5 4 4
0 4 2 3
0 3 3 2
T =
1 0 3 3
1 5 4 4
0 4 2 3
0 3 3 2
T =
1 0 3 3
1 0 4 4
0 4 2 3
0 3 3 2
T =
1 0 3 3
1 0 4 4
0 0 2 3
0 3 3 2
T =
1 0 3 3
1 0 4 4
0 0 2 3
0 1 3 2
T =
1 0 1 3
1 0 4 4
0 0 2 3
0 1 3 2
T =
1 0 1 3
1 0 0 4
0 0 2 3
0 1 3 2
T =
1 0 1 3
1 0 0 4
0 0 1 3
0 1 3 2
T =
1 0 1 3
1 0 0 4
0 0 1 3
0 1 1 2
T =
1 0 1 1
1 0 0 4
0 0 1 3
0 1 1 2
T =
1 0 1 1
1 0 0 0
0 0 1 3
0 1 1 2
T =
1 0 1 1
1 0 0 0
0 0 1 1
0 1 1 2
T =
1 0 1 1
1 0 0 0
0 0 1 1
0 1 1 0
|
1055 Solvers
136 Solvers
Sum all integers from 1 to 2^n
6329 Solvers
How long is the longest prime diagonal?
280 Solvers
478 Solvers