Pagini recente » Cod sursa (job #2654370) | Cod sursa (job #1611671) | Cod sursa (job #1839020) | Cod sursa (job #2873683) | Cod sursa (job #1675132)
#include <fstream>
#include <climits>
#include <cmath>
# define MAXN 16
using namespace std;
int mat[MAXN][MAXN];
ifstream in("flip.in");
ofstream out ("flip.in");
char n, m;
long long s, maxim, c;
void Read()
{
in>>n>>m;
for (int i = 0; i < n; i ++ )
{
for (int j = 0; j < m; j ++ )
{
in>>mat[i][j];
}
}
}
void Solve()
{
maxim = INT_MIN;
for (int bin = 0; bin < ( 1 << n ); bin ++ )
{
s = 0;
for (int j = 0; j < m; j ++ )
{
c = 0;
for (int i = 0; i < n; i ++ )
c += mat[i][j] * (1 - 2 * ( ( bin >> i ) & 1 ) );
s += abs(c);
}
if ( s > maxim )
maxim = s;
}
}
void Print()
{
out<<maxim<<'\n';
}
int main()
{
Read();
Solve();
Print();
return 0;
}