Pagini recente » Cod sursa (job #352739) | Cod sursa (job #867688) | Cod sursa (job #1441024) | Cod sursa (job #1208839) | Cod sursa (job #416809)
Cod sursa(job #416809)
#include<fstream.h>
#include<math.h>
ifstream f("flip.in");
ofstream g("flip.out");
int n,i,j,m,a[17][17],ra[17],max;
void sum()
{ int s=0;int i,ss;
for(int j=1;j<=m;j++)
{ ss=0;
for(i=1;i<=n;i++)ss+=a[i][j]*ra[i];
s+=abs(ss);
}
if(max<s)max=s;
}
void bbc(int i)
{ if(i==n)
{ ra[i]=1;
sum();
ra[i]=-1;
sum();
}
else
{ ra[i]=1;
bbc(i+1);
ra[i]=-1;
bbc(i+1);
}
}
int main()
{ f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
bbc(1);
g<<max;
f.close();
g.close();
return 0;
}