Pagini recente » Monitorul de evaluare | Borderou de evaluare (job #1232518) | Cod sursa (job #2387587) | Cod sursa (job #329753)
Cod sursa(job #329753)
#include <fstream.h>
#include <math.h>
int main()
{
ifstream in("flip.in");
ofstream out("flip.out");
long a[16][16];
short n,m,i,j,k;
long si1,si2,sj1,sj2,s=0;
in >> n >> m;
for (i=0;i<n;i++)
for (j=0;j<m;j++)
in >> a[i][j];
for (i=0;i<n;i++)
{
si1=si2=0;
for (j=0;j<m;j++)
if (a[i][j] < 0) si2 += a[i][j];
else si1 += a[i][j];
if (abs(si2) > si1)
for (j=0;j<m;j++)
a[i][j] = a[i][j]*(-1);
}
for (i=0;i<m;i++)
{
sj1=sj2=0;
for (j=0;j<n;j++)
if (a[j][i] < 0) sj2 += a[j][i];
else sj1 += a[j][i];
if (abs(sj2) > sj1)
for (j=0;j<n;j++)
a[j][i] = a[j][i]*(-1);
}
for (i=0;i<n;i++)
for (j=0;j<m;j++)
s += a[i][j];
out << s;
return 0;
}