Pagini recente » Cod sursa (job #1017263) | Cod sursa (job #1575868) | Cod sursa (job #2375432) | Cod sursa (job #263375) | Cod sursa (job #2137134)
#include <bits/stdc++.h>
using namespace std;
int N,M,a[17][17],so1,so2,b[17],sv1,sv2,c[17],st;
int main()
{
ifstream fin("flip.in");
ofstream fout("flip.out");
fin >> N >> M;
for (int i = 1; i<=N; i++){
for (int j = 1; j<=M; j++){
fin >> a[i][j];
so1+=a[i][j];
so2 = so2 + (-1) * a[i][j];
b[j] = (-1) * a[i][j];
}
if (so2 > so1)
for (int k=1; k<=M; k++){
a[i][k] = b[k];
}
so1 = so2 = 0;
}
for (int j =1; j<=M; j++){
for (int i =1; i<=N; i++){
sv1+=a[i][j];
sv2 = sv2 + (-1) * a[i][j];
c[i] = (-1) * a[i][j];
}
if (sv2 > sv1)
for (int k=1; k<=N; k++){
a[k][j] = c[k];
}
sv1 = sv2 = 0;
}
//cout << "\n";
for (int i = 1; i<=N; i++){
for (int j = 1; j<=M; j++){
//cout << a[i][j] << " ";
st+=a[i][j];
}
//cout << "\n";
}
fout << st;
return 0;
}