Pagini recente » Cod sursa (job #2073596) | Cod sursa (job #31018) | Cod sursa (job #794615) | Cod sursa (job #2954492) | Cod sursa (job #1730742)
#include <iostream>
#include <fstream>
#include <climits>
#include <cmath>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,bestsum,total;
int a[16][16];
int s[16];
void Sum()
{
int sum=0;
for(int j=0;j<m;j++){
sum=0;
for(int i=0;i<n;i++)
{
sum=sum+a[i][j]*s[i];
}
total+=abs(sum);
}
if(total>bestsum){
bestsum=total;
}
total=0;
}
void Gen(int k,int n)
{
for(int i=-1;i<2;i+=2)
{
s[k]=i;
if(k==n-1)
{
Sum();
}
else Gen(k+1,n);
}
}
int main()
{
f>> n >> m;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
f>> a[i][j];
Gen(0,n);
g << bestsum;
return 0;
}