Pagini recente » Cod sursa (job #1654178) | Cod sursa (job #853037) | Cod sursa (job #2162724) | Cod sursa (job #300972) | Cod sursa (job #877502)
Cod sursa(job #877502)
#include <iostream>
#include <fstream>
using namespace std;
int n,m,sol,x[17][17],v[17];
void parcurgere(int k)
{
int i,j,sum=0,s;
if(k==(n+1))
{
for(i=1;i<=m;i++)
{
s=0;
for(j=1;j<=n;j++)
s+=(x[j][i]*v[j]);
if(s<0)
sum+=-s;
else
sum+=s;
}
if(sum>sol)
sol=sum;
return;
}
v[k]=1;
parcurgere(k+1);
v[k]=-1;
parcurgere(k+1);
}
int main()
{
int i,j;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>x[i][j];
parcurgere(1);
g<<sol<<"\n";
f.close();
g.close();
return 0;
}