Pagini recente » Cod sursa (job #1936238) | Cod sursa (job #2820640) | Cod sursa (job #2020673) | Cod sursa (job #1568966) | Cod sursa (job #974844)
Cod sursa(job #974844)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,a[20][20];
int main()
{
fin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
fin >> a[i][j];
int smax = 0;
for(int i = 0; i < (1 << m); i++)
{
int sum = 0;
for(int j = 1; j <= n; j++)
{
int line = 0;
for (int k = 1; k <= m; ++k)
{
if (i & (1 << k))
{
line -= a[j][k];
}
else
{
line += a[j][k];
}
}
if (line < 0)
{
sum -= line;
}
else
{
sum += line;
}
}
smax = (smax < sum) ? sum : smax;
}
fout << smax;
return 0;
}