Cod sursa(job #563209)
Utilizator | Data | 24 martie 2011 19:05:40 | |
---|---|---|---|
Problema | Jocul Flip | Scor | 20 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 2.19 kb |
program flip;
var f,g:text;
n,m,i,j:byte;
v:array[1..20,1..20] of longint;
s:longint;
begin
assign(f,'flip.in');
reset(f);
assign(g,'flip.out');
rewrite(g);
readln(f,n,m);
for i:=1 to n+1 do
for j:=1 to m+1 do
v[i,j]:=0;
for i:=1 to n do
for j:=1 to m do
read(f,v[i,j]);
for i:=1 to n do
for j:=1 to m do
v[i,m+1]:=v[i,m+1]+v[i,j];
for i:=1 to m do
for j:=1 to n do
v[n+1,i]:=v[n+1,i]+v[j,i];
for i:=1 to n do
begin
s:=0;
for j:=1 to m do
s:=s+(-1*v[i,j]);
if s>v[i,m+1] then
for j:=1 to m do
v[i,j]:=v[i,j]*(-1);
end;
for i:=1 to m do
begin
s:=0;
for j:=1 to n do
s:=s+(-1*v[j,i]);
if s>v[n+1,i] then
for j:=1 to n do
v[j,i]:=v[j,i]*(-1);
end;
for i:=1 to n do
begin
v[i,m+1]:=0;
for j:=1 to m do
v[i,m+1]:=v[i,m+1]+v[i,j];
end;
for i:=1 to m do
begin
v[n+1,i]:=0;
for j:=1 to n do
v[n+1,i]:=v[n+1,i]+v[j,i];
end;
for i:=1 to n do
begin
s:=0;
for j:=1 to m do
s:=s+(-1*v[i,j]);
if s>v[i,m+1] then
for j:=1 to m do
v[i,j]:=v[i,j]*(-1);
end;
for i:=1 to m do
begin
s:=0;
for j:=1 to n do
s:=s+(-1*v[j,i]);
if s>v[n+1,i] then
for j:=1 to n do
v[j,i]:=v[j,i]*(-1);
end;
s:=0;
for i:=1 to n do
for j:=1 to m do
s:=s+v[i,j];
write(g,s);
close(f);close(g);
end.