Pagini recente » Cod sursa (job #1812776) | Cod sursa (job #2525766) | Cod sursa (job #1797376) | Cod sursa (job #648729) | Cod sursa (job #552845)
Cod sursa(job #552845)
#include<fstream.h>
#include<math.h>
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<pow(2,m);i++)
{s=0;
for(k=0;k<n;k++)
{for(t=j=0;j<m;j++)
if(i!=0 && pow(2,j)!=0)
t+=-a[k][j];
else
t+=a[k][j];
if(t<-t)
s=s-t;
else
s=s+t;
}
if(smax<s)
smax=s;
}
g<<smax<<'\n';
g.close();
return 0;
}