Pagini recente » Cod sursa (job #240839) | Cod sursa (job #897483) | Cod sursa (job #1118750) | Cod sursa (job #1485381) | Cod sursa (job #2959509)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
long long a[17][17];
int main()
{
int nc, nl, smax = -1000000, i, j, stotal, c, sc, l;
in >> nl >> nc;
for(i = 0; i < nl; i++){
for(j = 0; j < nc; j++){
in >> a[i][j];
}
}
for(i = 0; i < (1 << nl); i++){
stotal = 0;
for(c = 0; c < nc; c++){
sc = 0;
for(l = 0; l < nl; l++){
if(i & (1 << l)){
sc -= a[l][c];
}
else{
sc += a[l][c];
}
}
if(sc < 0){
sc =- sc;
}
stotal += sc;
}
smax = max(smax, stotal);
}
out << smax;
return 0;
}