Pagini recente » Cod sursa (job #2733831) | Cod sursa (job #1524817) | Cod sursa (job #1038278) | Cod sursa (job #407098) | Cod sursa (job #1210893)
#include <fstream>
#include<iostream>
using namespace std;
int main()
{
ifstream in;in.open("flip.in");
ofstream o;o.open ("flip.out", ofstream::out);
long M,N,f[10001][17],i,j,k,l,c,a[10001][17],p;
in>>N;in>>M;k=0;p=0;l=0;c=0;
for(i=0;i<N;i++)
{
for(j=0;j<M;j++)
{
in>>f[i][j];
a[i][j]=f[i][j];
k=k+f[i][j];
l=l+f[i][j];
}
if(l< -l)for(j=0;j<M;j++)f[i][j]=-f[i][j];l=0;
}
for(j=0;j<M;j++)
{
for(i=0;i<N;i++)
{ l=l+f[i][j];c=c+a[i][j];}
if(l< -l)for(i=0;i<N;i++)f[i][j]=-f[i][j];l=0;
if(c< -c)for(i=0;i<N;i++)a[i][j]=-a[i][j];c=0;
}
for(i=0;i<N;i++)
{
for(j=0;j<M;j++)
{
l=l+f[i][j];
p=p+a[i][j];c=c+a[i][j];
}
if(c< -c)p=p-c*2;
}
if(l>k)
if(l>p)o<<l;
else o<<p;
else if (p>k)o<<p;
else o<<k;
in.close();o.close();
return 0;
}