Cod sursa(job #921070)
Utilizator | Data | 20 martie 2013 19:15:00 | |
---|---|---|---|
Problema | Jocul Flip | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva de probleme | Marime | 1.14 kb |
var a: array[0..100,0..100] of longint;
maxim,n,m:longint;
fi,fo : text;
i,j:integer;
begin
assign(fi,'flip.in'); reset(fi); readln(fi,n,m);
for i:=1 to n do
for j:=1 to m do
read(fi,a[i,j]);
close(fi);
for i:=1 to (1 shl m)do begin sum:=0;
for k:=1 to n do begin
t:=0;
for j:=1 to m do
if i and (1 shl(j-1))>0 then t:=t-fl[k,j]
else t:=t+fl[k,j];
if t<-t then sum:=sum-t
else sum:=sum+t;
end;
if sum>maxim then maxim:=sum;
end;
assign(fo,'flip.out');
rewrite(fo);
writeln(fo,maxim);
close(fo);
end.