Finish 2003-11-12 15:00:00 UTC

nogt

by Paulo Uribe

Status: Passed
Results: pass
CPU Time: 0.231
Score: 100.0
Submitted at: 2003-11-05 15:54:30 UTC
Scored at: 2003-11-05 15:55:39 UTC

Current Rank: 57th
Based on: FDA12.3 (diff)

Comments
Please login or create a profile.
Code
[m n]=size(a);
b=0;
for i=1:m
 for j=1:m-i
  for k=1:n-j
   c = a(i:j+i,k:k+j);
   if ~(c-c(1)) 
    b = max(sum(c(:)),b);
   end
  end
 end
end