Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
I = [ 2 3 3 5 1 4 9 2 3 9 ];
J = [ 1 1 4 4 5 5 6 8 8 9 ];
M = 9; N = 9;
y_correct = [ 1 1 0 1 -1 1 1 1 1
-1 2 1 2 2 1 2 -1 2
-1 2 1 -1 2 1 2 -1 2
1 1 2 3 -1 1 1 1 1
0 0 1 -1 2 1 0 0 0
0 0 1 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 1 1 1 1 1
0 0 0 0 1 -1 1 1 -1 ];
assert(isequal(minehunting(I,J,M,N),y_correct))
mines =
Columns 1 through 10
0 0 0 0 1 1 1 0 0 0
1 1 1 0 1 0 1 1 1 1
2 1 2 1 2 2 1 2 1 2
2 1 2 1 1 2 1 2 1 2
1 1 1 2 3 2 1 1 1 1
0 0 0 1 1 2 1 0 0 0
0 0 0 1 1 1 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 1 1 1 1 1
0 0 0 0 0 1 0 1 1 0
0 0 0 0 0 1 1 1 1 1
Column 11
0
0
0
0
0
0
0
0
1
1
1
|
2 | Pass |
%%
I = 9; J = 9; M = 9; N = 9;
y_correct = [ 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 1 1
0 0 0 0 0 0 0 1 -1 ];
assert(isequal(minehunting(I,J,M,N),y_correct))
mines =
Columns 1 through 10
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 1
0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 1 1
Column 11
0
0
0
0
0
0
0
0
1
1
1
|
3 | Pass |
%%
I = 5; J = 5; M = 9; N = 9;
y_correct = [ 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 1 1 1 0 0 0
0 0 0 1 -1 1 0 0 0
0 0 0 1 1 1 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 ];
assert(isequal(minehunting(I,J,M,N),y_correct))
mines =
Columns 1 through 10
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 1 1 1 0 0 0
0 0 0 0 1 0 1 0 0 0
0 0 0 0 1 1 1 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0
Column 11
0
0
0
0
0
0
0
0
0
0
0
|
4 | Pass |
%%
[I,J] = ndgrid(1:2:11,1:2:5);
M = 11; N = 5;
y_correct = [ -1 2 -1 2 -1
2 4 2 4 2
-1 2 -1 2 -1
2 4 2 4 2
-1 2 -1 2 -1
2 4 2 4 2
-1 2 -1 2 -1
2 4 2 4 2
-1 2 -1 2 -1
2 4 2 4 2
-1 2 -1 2 -1 ];
assert(isequal(minehunting(I,J,M,N),y_correct))
mines =
1 1 2 1 2 1 1
1 0 2 0 2 0 1
2 2 4 2 4 2 2
1 0 2 0 2 0 1
2 2 4 2 4 2 2
1 0 2 0 2 0 1
2 2 4 2 4 2 2
1 0 2 0 2 0 1
2 2 4 2 4 2 2
1 0 2 0 2 0 1
2 2 4 2 4 2 2
1 0 2 0 2 0 1
1 1 2 1 2 1 1
|
5 | Pass |
%%
[I,J] = ndgrid(2:3:11,2:3:5);
M = 11; N = 5;
y_correct = [ 1 1 1 1 1
1 -1 1 1 -1
1 1 1 1 1
1 1 1 1 1
1 -1 1 1 -1
1 1 1 1 1
1 1 1 1 1
1 -1 1 1 -1
1 1 1 1 1
1 1 1 1 1
1 -1 1 1 -1 ];
assert(isequal(minehunting(I,J,M,N),y_correct))
mines =
0 0 0 0 0 0 0
0 1 1 1 1 1 1
0 1 0 1 1 0 1
0 1 1 1 1 1 1
0 1 1 1 1 1 1
0 1 0 1 1 0 1
0 1 1 1 1 1 1
0 1 1 1 1 1 1
0 1 0 1 1 0 1
0 1 1 1 1 1 1
0 1 1 1 1 1 1
0 1 0 1 1 0 1
0 1 1 1 1 1 1
|
9871 Solvers
235 Solvers
Make an awesome ramp for a tiny motorcycle stuntman
334 Solvers
Make a run-length companion vector
512 Solvers
251 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!