Pagini recente » Cod sursa (job #545994) | Cod sursa (job #332161) | Cod sursa (job #756210) | Cod sursa (job #957825) | Cod sursa (job #1310704)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{
long n,m,x[16][16],s,total,ok,i,j;
f >> n >> m;
for(i=0; i<n; i++)
for(j=0; j<m; j++)
f>> x[i][j];
ok = 0;
for(i=0; i<n; i++)
{
s = 0;
for(j=0; j<m; j++)
{
if(ok) x[i][j] *= -1;
else s+= x[i][j];
}
if(ok) ok = 0;
if(s<0)
{
ok=1;
i--;
}
}
ok = 0;
for(i=0; i<m; i++)
{
s=0;
for(j=0; j<n; j++)
{
if(ok) x[j][i] *= -1;
else s+=x[j][i];
}
if(ok) ok = 0;
if(s<0)
{
ok=1;
i--;
}
}
total = 0;
for( i=0; i<n; i++)
for(j=0; j<m; j++)
total += x[i][j];
g << total;
return 0;
}