Pagini recente » Cod sursa (job #2492873) | Cod sursa (job #1912182) | Cod sursa (job #1784621) | Cod sursa (job #2266172) | Cod sursa (job #1831623)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20],i,j,y,n,m,s1,s,x;
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
{
for(j=1;j<=m;++j)
{
f>>a[i][j];
s1+=a[i][j];
}
}
for(i=1;i<=(1<<n)-1;++i)
{
x=0;
for(j=1;j<=m;++j)
{
s=0;
for(y=1;y<=n;++y)
{
if((i&(1<<y))==0)
{
s+=a[y][j];
}
else
{
s-=a[y][j];
}
}
x+=max(s,-s);
}
s1=max(s1,x);
}
g<<s1;
return 0;
}