Pagini recente » Cod sursa (job #698092) | Istoria paginii summer-challenge-2007/solutii/runda-2 | Cod sursa (job #1773028) | Cod sursa (job #160849) | Cod sursa (job #2862545)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int main(){
int n, m, a[17][17], s=0;
fin >> n >> m;
for(int i=0; i < n; i++){
int s1=0, s2=0;
for(int j=0; j < m; j++){
fin >> a[i][j];
s1 += a[i][j];
}
if(s1 < 0)
for(int j=0; j < m; j++)
a[i][j] *= -1;
}
for(int j=0; j < m; j++){
int s1=0;
for(int i=0; i < n; i++){
s1 += a[i][j];
}
s += max(s1,-s1);
}
fout << s;
return 0;
}