Pagini recente » Cod sursa (job #3189271) | Cod sursa (job #807652) | Cod sursa (job #2073739) | Cod sursa (job #2158733) | Cod sursa (job #35934)
Cod sursa(job #35934)
#include<stdio.h>
int n,m,st[40];
long a[17][17],s;
FILE *f=fopen("flip.in","r");
FILE *g=fopen("flip.out","w");
void cit()
{
fscanf(f,"%d%d",&n,&m);
for(register int i=1;i<=n;i++)
for(register int j=1;j<=m;j++)
fscanf(f,"%ld",&a[i][j]);
}
void sol()
{
long suma=0;
long t[18][18];
for(int i=1;i<=n;i++)
{for(register int j=1;j<=m;j++)
t[i][j]=a[i][j];
if(st[i]==2)
for(register int j=1;j<=m;j++)
t[i][j]*=-1;
}
for(register int j=n+1;j<=m+n;j++)
if(st[j]==2)
for(register int i=1;i<=n;i++)
t[i][j-n]*=-1;
for(int x=1;x<=n;x++)
for(register int j=1;j<=m;j++)
suma+=t[x][j];
if(s<suma)
s=suma;
}
void back(int k)
{
if(k>n+m)
sol();
else for(register int i=1;i<=2;i++)
{st[k]=i;
back(k+1);}
}
int main()
{
cit();
s=0;
back(1);
fprintf(g,"%ld",s);
fcloseall();
return 0;
}