Pagini recente » Arhiva de probleme | Cod sursa (job #2307130) | Cod sursa (job #3215041) | Cod sursa (job #559997) | Cod sursa (job #692314)
Cod sursa(job #692314)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
long int i,j,m,n,k,aux,b[20],a[20][20],smat,s,max=0;
ifstream in("flip.in");
ofstream out("flip.out");
in>>n;
in>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{in>>a[i][j];
max=max+a[i][j];
}
for(i=0;i<(1<<n);i++)
{
aux=i;
for(j=1;j<=n;j++)
{
b[j]=aux&1;
aux=aux/2;
}
smat=0;
for(k=1;k<=m;k++)
{
s=0;
for(j=1;j<=n;j++)
{
if(b[j])
s+=a[j][k];
else
s-=a[j][k];
}
if(s<0)
smat-=s;
else
smat+=s;
}
if(smat>max)
max=smat;
}
out<<max;
in.close();
out.close();
return 0;
}