Pagini recente » Cod sursa (job #2872287) | Cod sursa (job #1447484) | Cod sursa (job #188767) | Cod sursa (job #2503204) | Cod sursa (job #2428738)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("flip.in");
ofstream fout ("flip.out");
int l[17],c[17];
int a[17][17];
int main()
{
int n,m;
fin >> n >> m;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++)
{
int x;
fin >> x;
a[i][j]=x;
l[i]+=x;
}
int ok=0;
do
{
ok=0;
for (int i=1; i<=max(n,m); i++)
l[i]=c[i]=0;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++)
{
l[i]+=a[i][j];
}
for (int i=1; i<=n; i++)
{
if (l[i]<0)
{
//cout << i << " linie \n";
for (int j=1; j<=m; j++)
a[i][j]=-a[i][j];
ok=1;
}
}
if (ok==0)
{
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++)
{
c[j]+=a[i][j];
}
for (int j=1; j<=m; j++)
{
if (c[j]<0)
{
//cout << j <<" cloana \n";
for (int i=1; i<=n; i++)
a[i][j]=-a[i][j];
ok=1;
}
}
}
}
while(ok==1);
int s=0;
for (int i=1; i<=n; i++)
for (int j=1; j<=m; j++)
s+=a[i][j];
fout << s;
return 0;
}