Pagini recente » Egyptian Fractions | Cod sursa (job #390933) | Cod sursa (job #1131639) | Cod sursa (job #515069) | Cod sursa (job #3147809)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int i, j, a[16][16], n, m;
void com_col(int spz, int sng){
for(j=0; j<m; j++){
sng=0; spz=0;
for(i=0; i<n; i++){
if(a[i][j] >= 0) spz = spz + a[i][j];
else sng = sng + a[i][j];
}
if(spz < abs(sng)){
for(i=0;i<n;i++) a[i][j] = a[i][j] * -1;
}
}
}
void com_lin(int spz, int sng){
for(i=0; i<n; i++){
sng=0; spz=0;
for(j=0; j<m; j++){
if(a[i][j] > 0) spz = spz + a[i][j];
else sng = sng + a[i][j];
}
if(spz < abs(sng)){
for(j=0; j<m; j++) a[i][j] = a[i][j] * -1;
}
}
}
int suma(){
int s=0;
for(i=0; i<n; i++){
for(j=0; j<m; j++){
s = s + a[i][j];
}
}
return s;
}
int main()
{
fin>>n>>m;
for(i=0; i<n; i++){
for(j=0; j<m; j++){
fin>>a[i][j];
}
}
com_col(0,0);
com_lin(0,0);
fout<<suma();
}