Pagini recente » Cod sursa (job #217075) | Cod sursa (job #701733) | Cod sursa (job #1477128) | Cod sursa (job #2647482) | Cod sursa (job #478837)
Cod sursa(job #478837)
#include <stdio.h>
int n,m,max,v[17][17];
int abs(int x)
{
if (x>0) return x;
else return -x;
}
void back(int t)
{
int i,j,s,sf=0;
if (t==n+1)
{
for (j=1;j<=m;j++)
{
s=0;
for (i=1;i<=n;i++) s+=v[i][j];
s=abs(s);
sf+=abs(s);
}
if (sf>max) max=sf;
return;
}
back(t+1);
for (i=1;i<=m;i++) v[t][i]=-v[t][i];
back(t+1);
for (i=1;i<=m;i++) v[t][i]=-v[t][i];
}
int main()
{
int i,j;
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d%d",&n,&m);
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
scanf("%d",&v[i][j]);
back(1);
printf("%d",max);
return 0;
}