Pagini recente » Cod sursa (job #2525984) | Cod sursa (job #2466315) | Cod sursa (job #2933411) | Cod sursa (job #1917824) | Cod sursa (job #2980679)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
long long n, m, a[20][20];
int main()
{
fin >> n >> m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
fin >> a[i][j];
/// verificam liniile
for(int i=1;i<=n;i++)
{
long long sum=0, sum_neg = 0;
for(int j=1;j<=m;j++)
{
sum+= a[i][j];
sum_neg+= -1*a[i][j];
}
if(sum_neg > sum)
for(int j=1;j<=m;j++)
a[i][j] = -1*a[i][j];
}
/// verificam coloanele
for(int j=1;j<=m;j++)
{
long long sum = 0, sum_neg = 0;
for(int i=1;i<=n;i++)
{
sum+= a[i][j];
sum_neg += -1*a[i][j];
}
if(sum_neg > sum)
for(int i=1;i<=n;i++)
a[i][j]*=-1;
}
long long s = 0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
s+= a[i][j];
fout << s;
return 0;
}