Pagini recente » Cod sursa (job #168282) | Cod sursa (job #1685351) | Cod sursa (job #1177995) | Cod sursa (job #2830926) | Cod sursa (job #1289039)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
#define NMAX 18
long a[NMAX][NMAX];
char ls[NMAX];
long m,n,sum;
void bkt(int k)
{
int i,j,s,sl;
if(k==m)
{
sum=0;
for(i=1;i<=m;i++)
{
sl=0;
for(j=1;j<=n;j++)
{
if(ls[j]=='1')
sl+=-a[i][j];
else
sl+=a[i][j];
}
if(sl<-sl)
sum+=-sl;
else
sum+=sl;
}
return;
}
ls[k]='0';
bkt(k+1);
ls[k]='1';
bkt(k+1);
}
int main()
{
int i,j;
f>>m>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
bkt(0);
g<<sum<<"\n";
return 0;
}