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))
|
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))
|
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))
|
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))
|
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))
|
556 Solvers
134 Solvers
289 Solvers
How long is the longest prime diagonal?
338 Solvers
2455 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!