Pagini recente » Cod sursa (job #405670) | Cod sursa (job #2871618) | Cod sursa (job #2864880) | Cod sursa (job #2760544) | Cod sursa (job #973709)
Cod sursa(job #973709)
#include <iostream>
#include <fstream>
#include <climits>
#include <math.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,a[20][20],maxim=-INT_MAX,i,j,lin[20],col[20],k,l,s,puterex,puterey,x,y;
int sum()
{
int suma=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(col[j]==lin[i])
suma=suma+a[i][j];
else
suma=suma-a[i][j];
}
return suma;
}
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fin>>a[i][j];
puterex=pow(2.0,double (n));
puterey=pow(2.0,double (m));
for(x=0;x<puterex;x++)
{
k=1;
int aux=x;
while(aux!=0)
{
lin[k++]=aux%2;
aux=aux/2;
}
for(i=1;i<=17;i++)
col[i]=0;
for(y=0;y<puterey;y++)
{
l=1;
int auy=y;
while(auy!=0)
{
col[l++]=auy%2;
auy=auy/2;
}
s=sum();
if(maxim<s)
maxim=s;
}
}
fout<<maxim;
return 0;}