Pagini recente » Cod sursa (job #2356257) | Cod sursa (job #709287) | Cod sursa (job #645078) | Cod sursa (job #1692966) | Cod sursa (job #1189309)
#include <fstream>
//#include <iostream>
using namespace std;
int n,m,i,j;
long long a[20][20],s[20],S,smax;
bool v[20];
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j],s[j]+=a[i][j];
while(!v[0])
{
j=m;
while(v[j]) v[j]=0,j--;
v[j]=1;S=0;
for(i=1;i<=m;i++)
{if(v[i]) S-=s[i];
if(!v[i]) S+=s[i];}
if(S<0) S=-S;
if(S>smax) smax=S;
}
g<<smax;
return 0;
}