Pagini recente » Cod sursa (job #1691183) | Cod sursa (job #1065043) | Cod sursa (job #968442) | Cod sursa (job #2261983) | Cod sursa (job #704836)
Cod sursa(job #704836)
#include<fstream>
#include<iostream>
using namespace std;
long int i,j,m,n,c,aux,x[1001],a[101][101],suma,s,max=-1;
int main()
{
int max=-1;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n;
f>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=0;i<(1<<n);i++)
{
aux=i;
for(j=1;j<=n;j++)
{
x[j]=aux&1;
aux=aux>>1;
}
suma=0;
for(c=1;c<=m;c++)
{
s=0;
for(j=1;j<=n;j++)
if(x[j])
s+=a[j][c];
else
s-=a[j][c];
if(s<0)
suma-=s;
else
suma+=s;
}
if(suma>max)
max=suma;
}
g<<max;
f.close();
g.close();
return 0;
}