Pagini recente » Cod sursa (job #2281290) | Cod sursa (job #2191449) | Cod sursa (job #2965676) | Cod sursa (job #2951754) | Cod sursa (job #2504231)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int main()
{
short m, n;
short i, j, k, l;
long s = 0, s1, s2;
long a[100][100];
fin >> m >> n;
for(i = 0; i < m; i ++)
for(j = 0; j < n; j ++)
fin >> a[i][j];
for(i = 0; i < m; i ++){
s1 = 0;
s2 = 0;
for(j = 0; j < n; j ++){
s1 += a[i][j];
}
for(k = 0; k < n; k ++){
a[i][k] *= -1;
s2 += a[i][k];
}
if(s1 > s2)
for(l = 0; l < n; l ++)
a[i][l] *= -1;
}
for(i = 0; i < n; i ++){
s1 = 0;
s2 = 0;
for(j = 0; j < m; j ++){
s1 += a[j][i];
}
for(k = 0; k < m; k ++){
a[k][i] *= -1;
s2 += a[k][i];
}
if(s1 > s2)
for(l = 0; l < m; l ++)
a[l][i] *= -1;
}
for(i = 0; i < m; i ++)
for(j = 0; j < n; j ++)
s += a[i][j];
fout << s;
fout.flush();
}