Pagini recente » Cod sursa (job #2608941) | Cod sursa (job #1842668) | Cod sursa (job #440863) | Istoria paginii runda/oji2016/clasament | Cod sursa (job #2115267)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
int n,m,a[20][20];
ifstream f("flip.in");
ofstream g("flip.out");
int sol(int x)
{
int S=0,rez=0;
for(int i=1;i<=n;i++)
{
S=0;
for(int j=1;j<=m;j++)
if(x&(1<<j-1))
S=S+a[i][j];
else
S=S-a[i][j];
rez += abs(S);
}
return rez;
}
int main()
{
int rez=0;
f>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
f>>a[i][j];
}
for(int x=0;x<=(1<<m);x++)
{
rez=max(rez,sol(x));
}
g<<rez;
return 0;
}