Cody

Problem 658. Find the biggest empty box

Solution 395112

Submitted on 31 Jan 2014 by Marco Castelli
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));

n = 1

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));

ans = 0 0 0 0 ans = 0 n = 2

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));

ans = 0 0 0 0 ans = 0 ans = 0 0 0 0 0 0 0 0 0 ans = 0 ans = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ans = 0 n = 4

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));

ans = 0 0 0 0 ans = 0 ans = 0 0 0 0 0 0 0 0 0 ans = 0 ans = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ans = 0 n = 4