Pagini recente » Cod sursa (job #2582304) | Cod sursa (job #2752773) | Cod sursa (job #2837309) | Cod sursa (job #2635135) | Cod sursa (job #240924)
Cod sursa(job #240924)
#include<fstream.h>
#include<math.h>
ifstream f("flip.in");
ofstream g("flip.out");
int n,m;
long x[20][20],s1,s2,s;
void main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>x[i][j];
for(int j=1;j<=m;j++)
{ s1=s2=0;
for(i=1;i<=n;i++)
if(x[i][j]>=0)
s1=s1+x[i][j];
else
s2=s2+x[i][j];
if(abs(s2)>s1)
for(i=1;i<=n;i++)
x[i][j]=(-1)*x[i][j];
}
for(i=1;i<=n;i++)
{ s1=s2=0;
for(j=1;j<=m;j++)
if(x[i][j]>=0)
s1=s1+x[i][j];
else
s2=s2+x[i][j];
if(abs(s2)>s1)
for(j=1;j<=m;j++)
x[i][j]=(-1)*x[i][j];
}
for(j=1;j<=m;j++)
{ s1=s2=0;
for(i=1;i<=n;i++)
if(x[i][j]>=0)
s1=s1+x[i][j];
else
s2=s2+x[i][j];
if(abs(s2)>s1)
for(i=1;i<=n;i++)
x[i][j]=(-1)*x[i][j];
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+x[i][j];
g<<s;
}