Pagini recente » Cod sursa (job #3212148) | Cod sursa (job #1011121) | Cod sursa (job #2406143) | Cod sursa (job #1188096) | Cod sursa (job #320294)
Cod sursa(job #320294)
#include<stdio.h>
int n,m,a[17][17],b[34],v[17],o[17];
int smax;
void afisare()
{int ii;
for(ii=1; ii<=n; ii++)v[ii]=b[ii];
for(ii=n+1; ii<=n+m; ii++)o[ii]=b[ii-n];
int sum=0;
int jj;
for(ii=1; ii<=n; ii++)
for(jj=1; jj<=m; jj++){if(v[ii]!=o[jj])sum=sum-1*a[ii][jj]; else sum+=a[ii][jj];}
if(sum>smax)smax=sum;
}
void generare(int k)
{int aux;
for(aux=0; aux<2; aux++){b[k]=aux; if(k<n+m)generare(k+1); else afisare(); }
}
int main(void)
{
freopen("flip.in","r",stdin);
freopen("flip.out","w",stdout);
scanf("%d %d",&n,&m);
int i,j;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)scanf("%d",&a[i][j]);
smax=-1000001;
generare(1);
printf("%d",smax);
return 0;
}