Pagini recente » Cod sursa (job #1840006) | preoni_2018 | 253913 | Cod sursa (job #1223742) | Cod sursa (job #942364)
Cod sursa(job #942364)
#include<fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[30][30],i,j,n,m,max1;
bool uz[260];
void prel()
{
int i,j,s1,s2;
s2=0;
for(j=1;j<=m;j++)
{
s1=0;
for(i=1;i<=n;i++)
if(uz[i]) s1+=-a[i][j];
else s1+=a[i][j];
if(s1<-s1) s1=-s1;
s2+=s1;
}
if(s2>max1) max1=s2;
}
void gen(int k)
{
int o;
for(o=0;o<=1;o++)
{
uz[k]=o;
if(k==n) prel();
else gen(k+1);
}
}
int main ()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
gen(1);
g<<max1;
return 0;
}