Pagini recente » Cod sursa (job #2586877) | Cod sursa (job #265805) | Cod sursa (job #2399763) | Cod sursa (job #470480) | Cod sursa (job #525563)
Cod sursa(job #525563)
#include<stdio.h>
bool solutie[20];
int m,n,a[20][20],max;
void prel()
{
int i,j,st=0,s;
for(i=1;i<=n;i++){
s=0;
for(j=1;j<=m;j++)
if(solutie[j])
s-=a[i][j];
else
s+=a[i][j];
if(s<0)
st-=s;
else
st+=s;
}
if(st>max)
max=st;
}
void estr(int p)
{
if(p==m+1){
prel();
return;
}
solutie[p]=false;
estr(p+1);
solutie[p]=true;
estr(p+1);
}
int main()
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
int i,j;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&a[i][j]);
estr(1);
printf("%d",max);
return 0;
}