Pagini recente » Cod sursa (job #164259) | Cod sursa (job #2163484) | Cod sursa (job #2828781) | Cod sursa (job #2208096) | Cod sursa (job #267778)
Cod sursa(job #267778)
#include<fstream.h>
ifstream f ("flip.in");
ofstream g ("flip.out");
int n,m,a[33],v[17][17],max;
void suma()
{
int suma=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
suma+=v[i][j]*a[i]*a[n+j];
}
if(suma>max) max=suma;
}
void back(int k)
{
if(k==n+m+1) suma();
else
{
a[k]=-1;
back(k+1);
a[k]=1;
back(k+1);
}
}
int main()
{
f>>n;
f>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>v[i][j];
back(1);
g<<max;
return 0;
}