Pagini recente » Cod sursa (job #1995093) | Cod sursa (job #3173338) | Cod sursa (job #1489416) | Cod sursa (job #2740840) | Cod sursa (job #1358746)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20],m,n,s=-9999999,i,j;
void suma()
{int s1,s2,sum=0;
for(j=0;j<n;j++)
{
s1=0;s2=0;
for(i=0;i<n;i++)
{
s1+=a[i][j];
s2+=-a[i][j];
}
sum+=max(s1,s2);
}
if(s<sum)
s=sum;
}
void back(int k)
{
if(k>n)
suma();
else
{
back(k+1);
for(j=0;j<m;j++)
a[k][j]*=(-1);
back(k+1);
for(j=0;j<m;j++)
a[k][j]*=(-1);
}
}
int main()
{
f>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
f>>a[i][j];
back(1);
g<<s;
return 0;
}