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 |
filetext = fileread('largest_pit.m')
assert(isempty(strfind(filetext, 'rand')))
assert(isempty(strfind(filetext, 'fileread')))
assert(isempty(strfind(filetext, 'assert')))
filetext =
'function y = largest_pit(X)
[row,col]=size(X);
ind=1;
counter(1,ind)=0;
for i=1:row
for j=1:col
if X(i,j)==1
counter(1,ind)=counter(1,ind)+1;
X(i,j)=2;
k=1;
position=[];
if i-1>0&&j-1>0&&X(i-1,j-1)==1
X(i-1,j-1)=2;
position(1,k)=i-1;
position(2,k)=j-1;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
if i-1>0&&X(i-1,j)==1
X(i-1,j)=2;
position(1,k)=i-1;
position(2,k)=j;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
if i-1>0&&j+1<=col&&X(i-1,j+1)==1
X(i-1,j+1)=2;
position(1,k)=i-1;
position(2,k)=j+1;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
if j-1>0&&X(i,j-1)==1
X(i,j-1)=2;
position(1,k)=i;
position(2,k)=j-1;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
if j+1<=col&&X(i,j+1)==1
X(i,j+1)=2;
position(1,k)=i;
position(2,k)=j+1;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
if j-1>0&&i+1<=row&&X(i+1,j-1)==1
X(i+1,j-1)=2;
position(1,k)=i+1;
position(2,k)=j-1;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
if i+1<=row&&X(i+1,j)==1
X(i+1,j)=2;
position(1,k)=i+1;
position(2,k)=j;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
if i+1<=row&&j+1<=col&&X(i+1,j+1)==1
X(i+1,j+1)=2;
position(1,k)=i+1;
position(2,k)=j+1;
k=k+1;
counter(1,ind)=counter(1,ind)+1;
end
while isempty(position)==0
[~,m]=size(position);
k=1;
position_co=[];
for n=1:m
if position(1,n)-1>0&&position(2,n)-1>0&&X(position(1,n)-1,position(2,n)-1)==1
X(position(1,n)-1,position(2,n)-1)=2;
position_co(1,k)=position(1,n)-1;
position_co(2,k)=position(2,n)-1;
k=k+1;
end
if position(1,n)-1>0&&X(position(1,n)-1,position(2,n))==1
X(position(1,n)-1,position(2,n))=2;
position_co(1,k)=position(1,n)-1;
position_co(2,k)=position(2,n);
k=k+1;
end
if position(1,n)-1>0&&position(2,n)+1<=col&&X(position(1,n)-1,position(2,n)+1)==1
X(position(1,n)-1,position(2,n)+1)=2;
position_co(1,k)=position(1,n)-1;
position_co(2,k)=position(2,n)+1;
k=k+1;
end
if position(2,n)-1>0&&X(position(1,n),position(2,n)-1)==1
X(position(1,n),position(2,n)-1)=2;
position_co(1,k)=position(1,n);
position_co(2,k)=position(2,n)-1;
k=k+1;
end
if position(2,n)+1<=col&&X(position(1,n),position(2,n)+1)==1
X(position(1,n),position(2,n)+1)=2;
position_co(1,k)=position(1,n);
position_co(2,k)=position(2,n)+1;
k=k+1;
end
if position(2,n)-1>0&&position(1,n)+1<=row&&X(position(1,n)+1,position(2,n)-1)==1
X(position(1,n)+1,position(2,n)-1)=2;
position_co(1,k)=position(1,n)+1;
position_co(2,k)=position(2,n)-1;
k=k+1;
end
if position(1,n)+1<=row&&X(position(1,n)+1,position(2,n))==1
X(position(1,n)+1,position(2,n))=2;
position_co(1,k)=position(1,n)+1;
position_co(2,k)=position(2,n);
k=k+1;
end
if position(1,n)+1<=row&&position(2,n)+1<=col&&X(position(1,n)+1,position(2,n)+1)==1
X(position(1,n)+1,position(2,n)+1)=2;
position_co(1,k)=position(1,n)+1;
position_co(2,k)=position(2,n)+1;
k=k+1;
end
end
position=unique(position_co','rows')';
[~,a]=size(position);
counter(1,ind)=counter(1,ind)+a;
end
end
ind=ind+1;
counter(1,ind)=0;
end
end
y=max(counter);
end
%This code written by profile_id 13231766
'
|
| 2 | Pass |
x = 1;
y_correct = 1;
assert(isequal(largest_pit(x),y_correct))
|
| 3 | Pass |
x = 0;
y_correct = 0;
assert(isequal(largest_pit(x),y_correct))
|
| 4 | Pass |
x = [1 0 1 0 1];
y_correct = 1;
assert(isequal(largest_pit(x),y_correct))
|
| 5 | Pass |
x = [ 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0
0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0
1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 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 1 0 0 0 0 0 0 0 0 1 1 0
0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 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 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0
1 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0
0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0
0 0 0 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 1 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 1 1 0 0 1 0 0 0 0 0];
assert(isequal(largest_pit(x),7))
|
| 6 | Pass |
x = [ 0 1 1 1 0 1 1 1 0 0
0 0 0 0 1 0 1 1 1 0
0 1 1 0 0 0 0 0 0 0
1 1 0 1 1 1 1 0 1 0
1 1 0 0 0 1 0 0 1 1
1 0 0 0 0 1 0 0 0 0
1 1 0 1 1 1 0 1 0 1
0 0 0 1 1 1 1 1 0 0
0 0 1 1 0 1 0 1 1 1
0 1 0 1 0 1 0 1 0 0];
assert(isequal(largest_pit(x),34))
|
| 7 | Pass |
x = [ 0 0 0 1 0 1 1 0 0 1 1
1 0 0 0 0 0 0 0 0 0 0
1 0 1 0 0 0 0 0 1 1 0
1 1 0 1 0 0 0 0 0 0 0
0 0 0 1 1 0 1 1 0 0 0
0 1 0 0 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0 0 1 0
0 0 0 1 0 0 0 0 0 1 0
0 0 0 1 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 1 0 0
0 0 1 0 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 1
0 1 0 0 0 0 0 0 0 1 1
0 1 0 0 0 0 1 0 0 0 0];
assert(isequal(largest_pit(x),8))
|
| 8 | Pass |
x = [ 1 0 1 0 0 0 0 0 1 0 1 1 0 0 0 0 1 0 1 1
0 1 1 0 0 1 1 0 0 0 1 0 0 0 0 1 0 0 1 0
0 0 0 0 1 1 0 0 0 1 1 0 0 0 0 0 0 0 1 0
0 0 0 1 0 1 0 0 0 0 1 0 0 0 0 1 1 0 1 0
0 0 0 0 0 1 0 1 1 0 0 0 0 0 0 0 0 1 0 0
0 0 1 0 1 1 0 1 0 0 0 0 0 1 0 0 0 0 1 0
1 0 1 1 0 0 0 0 0 0 1 1 0 1 1 1 0 0 0 0
0 0 1 0 1 1 0 0 1 0 0 0 0 1 0 0 0 0 0 1
0 0 0 0 0 0 0 1 0 1 1 1 0 1 0 0 0 0 0 0
0 0 0 1 0 1 1 1 0 0 1 1 0 0 0 0 1 0 0 0];
assert(isequal(largest_pit(x),15))
|
| 9 | Pass |
x = [ 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 1 0 0 0 1
1 0 0 1 0 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1
1 0 0 0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 1 0
1 0 0 1 0 0 0 0 1 1 0 0 0 1 0 1 0 0 0 0
1 1 0 1 0 0 1 0 0 0 1 1 0 0 0 1 1 1 0 1
0 1 0 0 1 1 0 0 0 0 0 0 0 0 0 0 1 0 0 1
0 0 0 0 1 1 1 0 0 0 0 1 0 0 0 0 1 0 1 1
1 1 0 0 0 1 1 0 1 1 0 1 1 0 1 1 0 0 0 1
0 0 0 1 0 1 0 1 0 0 0 1 0 0 0 1 0 0 1 0
1 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 1 0 1 1
0 0 0 0 0 0 0 1 0 0 1 0 1 0 0 0 1 1 1 0
1 0 0 0 0 0 1 0 0 0 0 0 1 1 1 0 0 0 0 1
1 1 0 0 0 1 0 0 0 1 0 1 0 0 0 0 0 0 0 0
0 1 0 0 1 0 0 0 0 0 0 1 1 0 1 0 1 0 0 1
0 0 0 1 0 0 0 1 1 0 0 0 0 1 0 0 0 1 0 1
0 1 0 1 0 1 1 0 0 0 1 1 0 0 0 0 1 0 0 0
1 0 0 0 0 1 1 1 1 0 0 0 0 0 0 1 1 0 1 0
0 0 1 0 1 0 0 0 0 1 0 0 0 1 1 1 0 0 0 0
0 0 1 0 1 0 0 1 0 0 0 0 0 0 0 0 0 1 0 0
1 0 0 1 0 1 1 0 1 0 0 1 0 0 0 0 0 0 0 0];
assert(isequal(largest_pit(x),27))
|
| 10 | Pass |
x = zeros(14);
assert(isequal(largest_pit(x),0))
|
| 11 | Pass |
x = [ 1 0 0 0 0 0 1 0 0 0 1 1 0 0 0 1 0
0 0 1 1 1 0 0 0 1 1 0 1 1 1 0 1 1
1 0 1 1 1 0 0 0 1 1 0 0 1 1 1 1 1
1 0 0 1 1 1 1 1 0 1 1 1 0 1 0 1 0
1 1 0 1 0 0 1 1 1 1 1 1 1 0 1 0 1
0 1 0 0 0 1 1 1 0 0 0 1 1 1 1 0 1
0 1 1 0 0 1 1 1 0 1 1 0 1 0 0 1 1
1 1 0 0 0 1 0 1 1 0 1 0 1 0 0 1 1
1 0 0 1 0 0 1 1 0 1 1 0 0 0 1 0 0
0 0 1 0 0 1 1 1 0 1 0 1 0 1 1 1 1
1 0 1 0 1 1 1 0 1 0 0 0 1 0 1 1 0
0 1 0 1 1 1 1 1 0 1 0 0 0 0 0 0 0
1 1 1 1 0 0 0 0 1 1 0 1 1 0 1 0 1
1 1 0 1 1 0 0 0 1 1 0 0 1 1 1 0 1
0 0 1 0 0 1 1 1 0 1 1 0 1 1 1 0 1
0 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1
1 1 1 0 1 0 1 1 1 1 0 0 1 1 0 1 0];
assert(isequal(largest_pit(x),150))
|
| 12 | Pass |
x = repmat([1 1 1 0;1 0 1 0;1 1 1 0; 0 0 0 0],4,5);
assert(isequal(largest_pit(x),8))
|
| 13 | Pass |
x = [0 1 0 1 0 0 0 1
1 0 0 1 1 0 0 0];
assert(isequal(largest_pit(x),3))
|
| 14 | Pass |
x = [ 0 1 0 0 0 1 0 0 0 1 1 1 1 0 1 1 1 1 0 0
1 0 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 1 1 0
1 0 0 0 0 0 1 0 0 0 0 1 1 1 1 0 1 1 0 1
0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 1 1 0
0 0 1 0 0 1 1 1 1 1 1 1 0 0 1 0 1 0 0 0
0 0 0 1 0 1 0 0 0 0 0 1 0 0 1 0 0 0 0 0
1 0 1 0 0 1 0 0 1 1 0 0 1 0 0 0 1 0 0 0
0 1 1 1 0 0 1 1 0 0 1 0 0 1 1 0 1 1 1 0
0 1 1 0 0 0 0 0 1 0 0 1 0 0 1 1 0 1 1 1
0 1 0 0 0 0 0 0 0 0 0 1 0 1 0 1 0 0 0 1
1 0 0 1 1 0 1 0 1 0 1 1 0 1 0 1 0 0 1 0
1 0 1 0 1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0
0 1 1 0 0 0 0 0 1 0 0 0 1 0 1 1 0 1 1 0
0 1 1 0 0 0 1 0 0 0 0 1 1 0 0 1 0 1 1 1
0 0 0 0 0 0 1 0 0 1 0 0 1 0 1 1 0 1 0 0
1 0 1 0 0 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1
1 0 1 1 0 0 0 0 1 0 0 0 1 1 0 0 0 0 0 0
1 1 0 0 1 0 0 1 0 1 1 1 1 0 1 1 0 0 0 1
0 0 0 1 0 0 1 0 0 1 1 1 0 0 1 0 0 0 0 1
0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0];
assert(isequal(largest_pit(x),91))
|
| 15 | Pass |
x = [ 0 1 0 0 1 1 0 1 0 0 0 0 1 0 1
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1
0 1 1 0 0 1 0 0 0 0 0 0 1 0 0
0 1 0 0 0 0 1 0 0 0 0 0 1 0 0
0 0 0 1 0 0 0 0 0 1 0 0 0 0 1
0 0 0 0 0 0 1 0 0 0 1 1 0 0 0
0 1 0 0 0 1 1 1 0 1 1 1 0 1 1
0 0 0 0 0 0 1 0 0 0 0 0 0 0 0
1 1 0 0 0 0 0 1 0 0 0 1 0 0 0
1 0 0 1 1 0 1 0 0 0 0 0 1 0 0
1 1 0 0 0 0 0 0 0 0 1 0 1 1 0
1 1 0 0 1 0 1 1 0 0 0 0 1 1 0
1 0 0 1 0 0 1 1 0 1 0 0 0 0 0
1 0 1 1 1 0 0 0 0 0 0 0 0 0 1
0 0 0 0 1 0 0 0 0 0 0 0 0 0 0];
assert(isequal(largest_pit(x),9))
|
| 16 | Pass |
x = [ 0 0 0 0 0 0 1 1 0 0 1 0 1 0 0
0 0 0 0 1 0 1 0 1 1 0 0 0 0 0
0 1 1 0 0 1 0 1 0 0 0 0 0 0 0
1 0 0 1 0 1 0 1 0 0 1 1 0 0 0
0 1 0 1 0 1 0 0 0 1 0 0 0 0 1
0 1 0 0 0 1 0 1 0 0 1 0 0 1 0
1 1 0 0 0 0 1 0 0 1 0 1 0 0 1
0 1 1 0 0 0 0 0 0 0 0 1 0 1 0
0 0 0 0 1 1 0 0 0 0 0 0 0 0 0
1 1 0 0 1 0 0 1 0 1 0 0 0 0 1
0 0 0 1 0 1 1 0 0 0 0 0 0 0 0
1 0 1 0 1 1 1 0 1 0 0 0 0 0 0
1 0 0 0 1 0 0 1 0 0 1 0 1 0 1
1 0 0 1 0 0 0 0 0 0 1 0 1 1 1
0 1 0 1 0 0 1 1 0 0 0 1 1 0 0];
assert(isequal(largest_pit(x),16))
|
| 17 | Pass |
x = [ 0 0 0 0 0 0 0 0 0 0 1 0 1 1 0 0 0 0 0 0
0 1 0 0 0 0 0 0 0 0 1 1 0 0 0 0 0 1 0 1
0 0 0 0 0 1 1 0 0 0 0 0 0 1 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 1 1 0 1 0 0 1 0 0
0 0 0 0 1 0 1 0 0 0 0 1 0 0 1 0 1 0 0 0
0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 1 1 0 0 0 0 0 1 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 0 0 0 1 0 1 0 0 0 0 0 0 1 0 0 1 0
0 0 1 0 0 0 0 0 0 0 0 0 1 0 0 1 1 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0
0 1 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 1 0
0 0 1 0 0 0 0 0 1 1 1 0 0 0 1 0 0 0 1 0
0 1 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 1 1 0];
assert(isequal(largest_pit(x),7))
|
| 18 | Pass |
x = [ 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 1 0 1
0 0 1 1 1 0 1 1 1 1 1 0 1 1 0 1 1 1 0 1];
assert(isequal(largest_pit(x),6))
|
| 19 | Pass |
x = [ 1 1 1 1 0 0 0 0 1 0 1 1 1 1 0 1 0 1 1 0
0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0
0 0 1 1 1 1 1 0 1 1 1 0 0 0 1 1 1 1 1 1
1 1 0 1 1 1 0 1 1 1 1 1 1 0 0 1 1 1 0 1
1 0 0 1 1 1 1 1 1 1 1 0 1 1 1 0 0 1 0 0
0 0 1 0 1 1 0 0 0 1 0 0 1 1 1 1 0 1 0 0
1 1 1 1 1 1 1 1 1 0 1 0 0 1 0 0 0 0 0 0
1 0 0 0 0 1 0 1 1 1 0 0 0 0 1 1 1 1 1 0
1 1 1 1 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 1
1 1 0 1 0 1 1 0 1 0 1 1 1 1 0 1 1 1 1 1];
assert(isequal(largest_pit(x),104))
|
| 20 | Pass |
x = [ 0 0 1 1 1 0 0 1 0 1 0 0 1 0 1 1 1
1 1 0 0 1 0 0 0 1 1 1 1 1 1 1 0 1
1 0 0 0 1 1 1 1 0 1 1 1 1 0 1 0 0
0 1 1 0 1 0 1 1 0 1 0 0 1 1 1 1 0
1 1 1 1 0 1 0 1 1 1 1 0 1 1 0 1 0
1 1 1 0 0 0 0 0 0 0 0 0 1 0 1 1 1
1 0 1 0 0 0 0 1 1 0 1 1 1 1 0 1 0
1 0 0 0 1 0 1 0 1 0 0 0 0 1 1 1 0
0 1 0 1 0 0 1 1 1 0 1 1 0 0 0 1 0
1 0 0 0 0 1 0 0 0 0 1 0 0 1 1 0 1
0 1 1 0 1 0 1 0 0 0 0 1 0 0 0 1 1
0 0 1 0 0 1 1 0 0 1 1 1 1 1 1 0 1
0 1 1 0 1 0 0 0 1 0 0 0 0 0 0 0 0
0 1 1 0 1 1 0 0 1 1 1 0 0 0 0 1 0
0 0 1 1 0 0 0 0 1 1 1 1 0 1 0 0 0
1 1 0 1 1 1 0 1 1 0 0 0 0 0 0 0 1
1 1 0 1 1 0 1 1 1 1 1 1 1 0 1 1 1
0 1 1 1 0 1 0 1 1 0 0 1 0 0 0 0 1
1 0 0 1 0 1 0 0 1 1 0 1 0 0 1 0 1
0 0 0 0 1 1 1 1 0 1 1 0 0 0 0 0 1];
assert(isequal(largest_pit(x),158))
|
Suggested Problems
-
17218 Solvers
-
Swap the first and last columns
12414 Solvers
-
485 Solvers
-
376 Solvers
-
177 Solvers
More from this Author19
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)