Pagini recente » Cod sursa (job #2216103) | Cod sursa (job #391721) | Cod sursa (job #2726484) | Cod sursa (job #2608086) | Cod sursa (job #954054)
Cod sursa(job #954054)
#include<fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,k,max1,x[17],a[17][17];
void prelsol()
{
int i,j,s1,s2;
s2=0;
for(j=1;j<=m;j++)
{
s1=0;
for(i=1;i<=n;i++) s1+=x[i]*a[i][j];
if(s1<0) s1=-s1;
s2+=s1;
}
if(s2>max1) max1=s2;
}
void back()
{
k=1,x[k]=-3;
do
{
while(x[k]<=-1)
{
x[k]+=2;
if(k==n) prelsol();
else x[++k]=-3;
}
k--;
}while(k);
}
int main ()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>a[i][j];
back();
g<<max1;
return 0;
}