Pagini recente » Cod sursa (job #868360) | Cod sursa (job #2085972) | Cod sursa (job #1867663) | Cod sursa (job #1575607) | Cod sursa (job #292493)
Cod sursa(job #292493)
#include<fstream.h>
ifstream intrare("flip.in");
ofstream iesire("flip.out");
long int a[17][17],maxim;
int n,m,sol[35];
void citeste()
{
intrare>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
intrare>>a[i][j];
}
}
}
void calculeaza()
{
int s=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(sol[i]==sol[n+j])s+=a[i][j];
else s-=a[i][j];
}
}
if(maxim<s)maxim=s;
}
void back(int k)
{
if(k==m+n+1)calculeaza();
else
{
sol[k]=1;
back(k+1);
sol[k]=0;
back(k+1);
}
}
int main()
{
citeste();
maxim=-10000;
back(1);
iesire<<maxim;
return 0;
}