Pagini recente » Cod sursa (job #1143230) | Cod sursa (job #582473) | Cod sursa (job #1590245) | Cod sursa (job #2974934) | Cod sursa (job #2862727)
#include<fstream>
long n,m,a[16][16],i,j,k,t,s,smax;
using namespace std;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{f>>a[i][j];}
f.close();
for(i=0;i<(1<<m);i++)
{
s=0;
for(k=0;k<n;k++)
{
for(t=j=0;j<m;j++)
if(i&1<<j) t+=-a[k][j];
else t+=a[k][j];
s+=t<-t ? -t:t;
}
if(smax<s) {smax=s;}
}
g<<smax<<'\n';
g.close();
return 0;
}