Pagini recente » Cod sursa (job #1372266) | Cod sursa (job #1106099) | Cod sursa (job #1148148) | Cod sursa (job #1607997) | Cod sursa (job #2587318)
#include <bits/stdc++.h>
using namespace std;
long long flip[16][16];
int N, M;
int main()
{
ifstream in("flip.in");
ofstream out("flip.out");
//istream &in = cin;
//ostream &out = cout;
long long S = 0;
in >> N >> M;
for (int i = 0;i < N; i++)
{
for (int j = 0; j < M; j++)
{
in >> flip[i][j];
S += flip[i][j];
}
}
bool flipped;
do
{
flipped = false;
for (int i = 0; i < N; i++)
{
long long s = 0;
for (int j = 0; j < M; j++)
s += flip[i][j];
if (s < 0)
{
flipped = true;
for (int j = 0; j < M; j++)
flip[i][j] = -flip[i][j];
S -= 2 * s;
}
}
for (int j = 0; j < M; j++)
{
long long s = 0;
for (int i = 0; i < N; i++)
s += flip[i][j];
if (s < 0)
{
flipped = true;
for (int i = 0; i < N; i++)
flip[i][j] = -flip[i][j];
S -= 2 * s;
}
}
}
while (flipped);
out << S;
}