Pagini recente » Cod sursa (job #2092838) | Cod sursa (job #2707635) | Cod sursa (job #2118258) | Cod sursa (job #2489713) | Cod sursa (job #1362033)
#include<fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
bool p[17];
int m,n,maxi=-99999999;
int a[17][17];
void calc()
{
int i,t=0,j,s=0;
for (j=1; j<=m; j++)
{
s=0;
for (i=1;i<=n;i++)
{
if (p[i]==0)
{
s+=a[i][j];
}
else
{
s-=a[i][j];
}
}
if (s<0){s=-s;}
t+=s;
}
if (t>maxi)
{
maxi=t;
}
}
void rez(int k)
{
if (k>n)
{
calc();
}
else
{
p[k]=0;
rez(k+1);
p[k]=1;
rez(k+1);
}
}
int main()
{
int i,j;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
rez(1);
g<<maxi<<'\n';
}