Pagini recente » Cod sursa (job #2756781) | Cod sursa (job #2969789) | Cod sursa (job #3194538) | Cod sursa (job #2933819) | Cod sursa (job #616174)
Cod sursa(job #616174)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,sol[100],a[20][20],smax=0;
void citire()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>a[i][j];
}
int prelucrare(int j)
{
int i,s=0;
for(i=1;i<=n;i++)
if(sol[i])
s=s-a[i][j];
else
s=s+a[i][j];
if(s>0)
return s;
else
return -s;
}
void valid()
{
int j,s=0;
for(j=1;j<=m;j++)
s=s+prelucrare(j);
if(s>smax)
smax=s;
}
void bkt(int p)
{
if(p==n+1)
{
valid();
return;
}
sol[p]=0;
bkt(p+1);
sol[p]=1;
bkt(p+1);
}
int main()
{
citire();
bkt(1);
g<<smax;
return 0;
f.close();
g.close();
}