Pagini recente » Cod sursa (job #1865147) | Cod sursa (job #641777) | Cod sursa (job #2104260) | Cod sursa (job #901860) | Cod sursa (job #1779071)
#include <fstream>
#include <stdlib.h>
#include <iostream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,j,a[120][120],r,t,p,max1=-1,n,m;
void sum()
{
int i,j,s1=0,stot=0;
for(i=1;i<=n;i++)
{
s1=0;
for(j=1;j<=m;j++)
s1=s1+a[i][j];
stot=stot+abs(s1);
}
if(max1<stot)
max1=stot;
}
int schimb(int k)
{
int i;
for(i=1;i<=n;i++)
a[i][k]=-a[i][k];
}
void back1(int p)
{
if(p>m)
{
sum();
}
else
{
back1(p+1);
schimb(p);
back1(p+1);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
back1(1);
g<<max1;
}