Pagini recente » Cod sursa (job #2456236) | Cod sursa (job #377417) | Cod sursa (job #606911) | Cod sursa (job #2172999) | Cod sursa (job #954059)
Cod sursa(job #954059)
#include<fstream>
using namespace std;
ifstream f("flip.in");ofstream g("flip.out");
int n,m,k,max1,x[17],a[17][17];
int main ()
{ f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>a[i][j];
int nr=0,vf=1<<n;
for(;nr<vf;++nr)
{ for(int i=1;i<=n;++i)
{ x[i]=(nr>>(i-1))&1;
int s1,s2=0;
for(int j=1;j<=m;j++)
{ s1=0;
for(int i=1;i<=n;i++)
if(x[i]) s1+=a[i][j]; else s1-=a[i][j];
if(s1<0) s1=-s1;
s2+=s1;
}
if(s2>max1) max1=s2;
}
}
g<<max1; return 0;
}