Pagini recente » Cod sursa (job #1700909) | Cod sursa (job #2927189) | Cod sursa (job #694199) | Cod sursa (job #307571) | Cod sursa (job #1724951)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20], n, m;
long long s, sum, sol;
int main()
{
f >> n >> m;
for ( int i = 0; i < n; i ++ )
for ( int j = 0; j < m; j ++ )
{
f >> a[i][j];
sol += a[i][j];
}
for ( int k = 0; k < (1<<m); k ++ )
{
sum = 0;
for ( int i = 0; i < n; i ++ )
{
s = 0;
for ( int j = 0; j < m; j ++ )
{
if ( ( 1 << j ) & k ){
s += a[i][j];
}
else{
s -= a[i][j];
}
}
sum += abs( s );
}
if( sum > sol )
sol = sum;
}
g << sol;
f.close();
g.close();
return 0;
}