Pagini recente » Cod sursa (job #1006405) | Cod sursa (job #1395765) | Cod sursa (job #1223447) | Cod sursa (job #2561074) | Cod sursa (job #2989577)
#include <fstream>
using namespace std;
ifstream fin ("flip.in");
ofstream fout ("flip.out");
int n,m,i,j,sum,s,maxc,x[17],v[17][17];
int main()
{
fin>>n>>m;
for (i=1; i<=n; i++)
{
for (j=1; j<=m; j++)
fin>>v[i][j];
}
while (x[m+1]==0)
{
sum=0;
for (i=1; i<=n; i++)
{
s=0;
for (j=1; j<=m; j++)
{
if (x[j]==0)
s=s+v[i][j];
else
s=s-v[i][j];
}
if (s<0)
s=s*(-1);
sum+=s;
}
if (sum>maxc)
maxc=sum;
j=1;
while (x[j]==1)
{
x[j]=0;
j++;
}
x[j]=1;
}
fout<<maxc;
return 0;
}