Pagini recente » Cod sursa (job #323736) | Cod sursa (job #1300918) | Istoria paginii runda/piscot1024 | Cod sursa (job #1122931) | Cod sursa (job #2638050)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("flip.in", ios::in);
ofstream fout("flip.out", ios::out);
int N, M;
fin >> N >> M;
if (N < 1 || M>16)
return 0;
long a[100][100], suma;
int i, j;
suma = 0;
for (i = 0; i < N; i++)
for (j = 0; j < M;j++)
fin >> a[i][j];
for (i = 0; i < N; i++)
for (j = 0; j < M;j++)
suma = suma + a[i][j];
long suma1 = 0;
long suma2 = 0;
for (i = 0; i < N; i++)
{
for (j = 0; j < M; j++)
{
suma1 = suma1 + a[i][j];
}
for (j = 0; j < M; j++)
{
suma2 = suma2 - a[i][j];
}
if (suma2 > suma1)
{
suma = suma - suma1 + suma2;
for (j = 0; j < M;j++)
a[i][j] = -a[i][j];
}
suma1 = 0;
suma2 = 0;
}
for (j = 0; j < M; j++)
{
for (i = 0; i < N; i++)
{
suma1 = suma1 + a[i][j];
}
for (i = 0; i < N; i++)
{
suma2 = suma2 - a[i][j];
}
if (suma2 > suma1)
{
suma = suma - suma1 + suma2;
for (i = 0; i < N; i++)
a[i][j] = -a[i][j];
}
suma1 = 0;
suma2 = 0;
}
fout << suma;
return 1;
}