Pagini recente » Cod sursa (job #1357125) | Cod sursa (job #2626763) | Cod sursa (job #3131357) | Cod sursa (job #305382) | Cod sursa (job #66116)
Cod sursa(job #66116)
#include<stdio.h>
//#include<math.h>
long n,m,t,p,i,j,a[20][20],max,suma,col[18];
int main()
{
freopen("flip.out","w",stdout);
freopen("flip.in","r",stdin);
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)
for(j=0;j<m;j++)
scanf("%ld",&a[i][j]);
t=1<<n;
for(i=0;i<=t;i++)
{
for(j=0;j<m;j++)
{col[j]=0;
for(p=0;p<n;p++)
if ((i>>p)&1)
col[j]=col[j]-a[p][j];
else
col[j]=col[j]+a[p][j];
}
suma=0;
for(j=0;j<m;j++)
if(col[j]<0) suma=suma-col[j];
else
suma+=col[j];
if(max<suma) max=suma;
}
printf("%ld\n",max);
return 0;
}