Cod sursa(job #219136)
#include <stdio.h>
using namespace std;
int K[20],n,m;
long T[20][20],S;
void citire()
{
FILE *fin=fopen("flip.in","r");
fscanf(fin,"%d%d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
fscanf(fin,"%ld",&T[i][j]);
fclose(fin);
}
void cauta_sol()
{
long s,total=0;
for (short i=1;i<=n;i++)
{
s=0;
for (short j=1;j<=m;j++)
s+=(T[i][j]*K[j]);
if (s<0) s*=-1;
total+=s;
}
if (S<total)S=total;
}
void generare(int i)
{
if (i>m) cauta_sol();
else
{
K[i]=1; generare(i+1);
K[i]=-1;generare(i+1);
}
}
void afisare()
{
FILE *fout=fopen("flip.out","w");
fprintf(fout,"%ld\n",S);
fclose(fout);
}
int main()
{
citire();
S=-1000000;
generare(1);
afisare();
return 0;
}