Pagini recente » Cod sursa (job #2807495) | Cod sursa (job #1386392) | Cod sursa (job #534054) | Cod sursa (job #2808157) | Cod sursa (job #2777102)
#include<fstream>
using namespace std;
ifstream F("flip.in");
ofstream G("flip.out");
int a[17][17],s[17],b,n,m,i,j;
void B(int k)
{
int i,c;
if(k==n+1) {
for(c=0,i=1;i<=m;++i)
c+=s[i]>0?s[i]:-s[i];
b=c>b?c:b;
return;
}
B(k+1);
for(i=1;i<=m;++i)
s[i]-=2*a[k][i];
B(k+1);
for(i=1;i<=m;++i)
s[i]+=2*a[k][i];
}
int main()
{
F>>n>>m;
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
F>>a[i][j],s[j]+=a[i][j];
B(1),G<<b;
return 0;
}