Pagini recente » Cod sursa (job #1423594) | Cod sursa (job #435489) | Cod sursa (job #2047220) | Cod sursa (job #1572409) | Cod sursa (job #708392)
Cod sursa(job #708392)
#include <iostream>
#include<fstream>
using namespace std;
fstream f("flip.in",ios::in);
fstream g("flip.out",ios::out);
long i,j,m,n,max1,max2,s,a[20][20];
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(j=1;j<=m;j++)
{max1=0;max2=0;
for(i=1;i<=n;i++)
{ max1=max1+(a[i][j]*-1);
max2=max2+a[i][j];
}
if(max2<max1)
{for(i=1;i<=n;i++)
a[i][j]=a[i][j]*-1;}
}
for(i=1;i<=n;i++)
{ max1=0;max2=0;
for(j=1;j<=m;j++)
{ max1=max1+(a[i][j]*-1);
max2=max2+a[i][j];
}
if(max2<max1)
{for(j=1;j<=m;j++)
a[i][j]=a[i][j]*-1;}
}
for(j=1;j<=m;j++)
{max1=0;max2=0;
for(i=1;i<=n;i++)
{ max1=max1+(a[i][j]*-1);
max2=max2+a[i][j];
}
if(max2<max1)
{for(i=1;i<=n;i++)
a[i][j]=a[i][j]*-1;}
}
s=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+a[i][j];
g<<s;
return 0;
}