Cody

Solution 1219392

Submitted on 24 Jun 2017 by Augusto Mazzei
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
a = [1 0; 0 0]; [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 1; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

L = 2 L = 1 go = 0 r1 = 1 r2 = 1 c1 = 2 c2 = 2 go = 0 r1 = 2 r2 = 2 c1 = 1 c2 = 1 L = 0

2   Pass
a = [1 0 0; 0 0 0; 0 0 0]; [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 2; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

L = 3 L = 2 go = 0 r1 = 1 r2 = 2 c1 = 2 c2 = 3 go = 0 r1 = 2 r2 = 3 c1 = 1 c2 = 2 L = 1

3   Pass
a = eye(9); [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 4; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

L = 9 L = 8 L = 7 L = 6 L = 5 L = 4 go = 0 r1 = 1 r2 = 4 c1 = 5 c2 = 8 go = 0 r1 = 5 r2 = 8 c1 = 1 c2 = 4 go = 0 r1 = 6 r2 = 9 c1 = 1 c2 = 4 L = 3

4   Pass
a = double(magic(7)<6); [r1,r2,c1,c2] = biggest_box(a); sub = a(r1:r2,c1:c2); [m,n] = size(sub); len = 4; assert(isequal(sum(sub(:)),0)) assert(isequal(m,len)); assert(isequal(n,len));

L = 7 L = 6 L = 5 L = 4 go = 0 r1 = 2 r2 = 5 c1 = 2 c2 = 5 L = 3