Pagini recente » Cod sursa (job #2902119) | Cod sursa (job #2544988) | Cod sursa (job #480417) | Cod sursa (job #2906810) | Cod sursa (job #2594171)
#include<iostream>
#include<fstream>
using namespace std;
int main ()
{
ifstream f("flip.in");
ofstream g("flip.out");
int N,M,i,j;
long a[16][16],s1=0,s2=0,smax=0;
f>>N>>M;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
f>>a[i][j];
for(i=1;i<=N;i++)
{
for(j=1;j<=M;j++)
{
s1=s1+a[i][j];
s2=s2-a[i][j];
}
if(s1<s2)
{
for(j=1;j<=M;j++)
a[i][j]=a[i][j]*(-1);
}
s2=s1=0;
}
s2=s1=0;
for(j=1;j<=M;j++)
{
for(i=1;i<=N;i++)
{
s1=s1+a[i][j];
s2=s2-a[i][j];
}
if(s1<s2)
{
for(i=1;i<=M;i++)
a[i][j]=a[i][j]*(-1);
smax+=s2;
}
else
smax+=s1;
s1=s2=0;
}
g<<smax;
f.close(); g.close();
return 0;
}