Pagini recente » Cod sursa (job #797725) | Monitorul de evaluare | Cod sursa (job #1371087) | Cod sursa (job #1657244) | Cod sursa (job #2841687)
#include <bits/stdc++.h>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n, m, a[20][20], stare, res;
int coloane(int s){
int sumt=0, suml=0;
for(int i=1; i<=n; i++){
suml=0;
for(int j=1; j<=m; j++){
if((s&(1<<(j-1)))!=0){
suml=suml-a[i][j];
}else{
suml=suml+a[i][j];
}
}
sumt+=abs(suml);
}
return sumt;
}
int main()
{
in>>n>>m;
for(int i=1; i<=n; i++){
for(int j=1; j<=m; j++){
in>>a[i][j];
}
}
stare=(1<<m)-1;
for(int i=0; i<=stare; i++){
res=max(res,coloane(i));
}
out<<res;
return 0;
}