Pagini recente » Cod sursa (job #878985) | Cod sursa (job #2456241) | Cod sursa (job #2573797) | Cod sursa (job #1260221) | Cod sursa (job #2364378)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int tabla[17][17],i,j,n,m,t[17];
int bck(int p)
{
if (p<=m)
{
t[p]=1;
int p1=bck(p+1);
t[p]=-1;
int p2=bck(p+1);
return (p1>p2?p1:p2);
}
else
{
int sum=0;
for (int i=1;i<=n;++i)
{
int sumc=0;
for (int j=1;j<=m;++j)
sumc+=tabla[i][j]*t[j];
sum+=(sumc>0?sumc:-sumc);
}
return sum;
}
}
int main()
{
f>>n>>m;
for (i=1;i<=n;++i)
for (j=1;j<=m;++j)
f>>tabla[i][j];
g<<bck(1);
}