Pagini recente » Cod sursa (job #3122564) | Cod sursa (job #1983853) | Cod sursa (job #272179) | Cod sursa (job #2562456) | Cod sursa (job #1263594)
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE *in = fopen ("flip.in", "r");
FILE *out = fopen ("flip.out", "w");
int n, m; fscanf (in, "%d%d", &n, &m);
int ma[17][17];
int i, j;
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j)
fscanf (in, "%d", &ma[i][j]);
int k; int max = 0;
int power = 1 << n;
for (k = 0; k < power; ++k)
{
for (i = 1; i <= n; ++i)
if ((k & (1 << i)))
{
for (j = 1; j <= m; ++j)
ma[i][j] *= -1;
}
int maxim = 0;
for (i = 1; i <= m; ++i)
{
int suma = 0;
for (j = 1; j <= n; ++j)
suma += ma[j][i];
if (suma < 0)
maxim += suma * (-1);
else
maxim += suma;
}
if (max < maxim)
max = maxim;
for (i = 1; i <= n; ++i)
if ((k & (1 << i)))
for (j = 1; j <= m; ++j)
ma[i][j] *= -1;
}
printf ("%d", max);
fclose (in);
fclose (out);
return 0;
}