Pagini recente » Cod sursa (job #249727) | Cod sursa (job #1473802) | Cod sursa (job #2125489) | Cod sursa (job #3157346) | Cod sursa (job #559503)
Cod sursa(job #559503)
#include<fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int main ()
{ int n,m,M,j,i,k,smax=0,s,p,x,q,a[17][17],b[1000];
fin>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
fin>>a[i][j];
M=(1<<m)-1;
for(i=0; i<=M; i++)
{ k=i;
j=0;
while(k)
{ b[j]=k%2;
k=k/2;
j++;
}
s=0;
for(p=0;p<n;p++)
{ x=0;
for(q=0;q<m;q++)
{if(b[q]==0)
x=x+a[p][q];
else
x=x-a[p][q];
}
s=s+abs(x);
}
if(smax<s) smax=s;
}
fout<<smax<<"\n";
fin.close();
fout.close();
return 0;
}