Pagini recente » Rezultatele filtrării | Cod sursa (job #1411721) | Cod sursa (job #1944507) | Cod sursa (job #1395378) | Cod sursa (job #695460)
Cod sursa(job #695460)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
int n,m,a[16][16],i,j,s=0,k,max=0,l;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=1;i<=(1<<m);i++)
{
s=0;
for(k=1;k<=n;k++)
{
l=0;
for(j=1;j<=m;j++)
if(i&(1<<j))
l+=-a[k][j];
else
l+=a[k][j];
s+=l<-l?-l:l;
}
if(s>max)
max=s;
}
g<<max<<endl;
f.close();
g.close();
return 0;
}