Pagini recente » Cod sursa (job #454722) | Cod sursa (job #1269349) | Cod sursa (job #1872406) | Cod sursa (job #469090) | Cod sursa (job #952150)
Cod sursa(job #952150)
#include <cstdio>
#define NMAX 20
#define maxim(a,b) ((a>b)?(a):(b))
using namespace std;
long long m[NMAX][NMAX],a[2*NMAX],N,M,Sol;
void citire()
{
freopen("flip.in","r",stdin);
scanf("%lld %lld",&N,&M);
long long i,j;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
scanf("%lld",&m[i][j]);
}
long long sum()
{
long long i,j,S=0;
for(i=1;i<=N;i++)
for(j=1;j<=M;j++)
if(a[i]==a[N+j])
S+=m[i][j];
else
S-=m[i][j];
return S;
}
void solve()
{
long long i,j,aux;
for(i=(1<<(N+M))-1;i;i--)
{
for(j=1,aux=i;j<=N+M;a[j++]=aux&1,aux>>=1);
Sol=maxim(Sol,sum());
}
}
void afisare()
{
freopen("flip.out","w",stdout);
printf("%lld",Sol);
}
int main()
{
citire();
solve();
afisare();
return 0;
}