Pagini recente » Cod sursa (job #890941) | Cod sursa (job #3269488) | Cod sursa (job #3288231) | Cod sursa (job #2707883) | Cod sursa (job #459350)
Cod sursa(job #459350)
#include <stdio.h>
#include <math.h>
int a[20][20];
int st[20];
int m, n, i, j, k;
int Max = -100000;
int modul (int x)
{
if (x < 0)
return -x;
return x;
}
void suma ()
{
int suma_linie = 0, suma_total = 0;
for (i=1; i<=m; ++i)
{
suma_linie = 0;
for (j=1; j<=n; ++j)
{
if (st[j] == 1)
suma_linie += a[j][i];
else
suma_linie = suma_linie + a[j][i] * (-1);
}
suma_total += modul(suma_linie);
}
if (Max < suma_total)
Max = suma_total;
}
void back (int k)
{
int t;
for (t=1; t<=2; ++t)
{
st[k] = t;
if (k < n)
back (k + 1);
else
suma ();
}
}
int main ()
{
FILE *f = fopen ("flip.in","r");
FILE *g = fopen ("flip.out","w");
fscanf (f,"%d %d", &n, &m);
for (i=1; i<=n; ++i)
for (j=1; j<=m; ++j)
fscanf (f,"%d", &a[i][j]);
back(1);
fprintf (g,"%d", Max);
fclose(f);
fclose(g);
return 0;
}