Pagini recente » Cod sursa (job #1966592) | Cod sursa (job #3357220) | Cod sursa (job #655123) | Cod sursa (job #2316934) | Cod sursa (job #1907762)
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
int main()
{
ifstream f ("flip.in");
ofstream g ("flip.out");
int n,m,i,j,p,neg,a[100][100],d;
f>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>a[i][j];
f.close();
for (j=1;j<=m;j++)
{ p=0; neg=0;d=j;
for (i=1;i<=n;i++)
{
if (a[i][j]>0) p=p+a[i][j];
else neg=neg+a[i][j];
}
if (neg*(-1)>p)
{
for (i=1;i<=n;i++)
a[i][d]=a[i][d]*(-1);
}
}
for (i=1;i<=n;i++)
{ p=0; neg=0;d=i;
for (j=1;j<=m;j++)
{
if (a[i][j]>0) p=p+a[i][j];
else neg=neg+a[i][j];
}
if (neg*(-1)>p)
{
for (j=1;j<=m;j++)
a[d][j]=(-1)*a[d][j];
}
}
p=0;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
p=p+a[i][j];
g<<p;
g.close();
return 0;
}