Pagini recente » Cod sursa (job #2390684) | Cod sursa (job #439784) | Cod sursa (job #1866274) | Cod sursa (job #2630865) | Cod sursa (job #2984659)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
long long n,m,x,f[35],v[17][17];
int main()
{
fin>>n>>m;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
{
fin>>v[i][j];
}
long long mx=-2e7;
for (long long i=1;i<=(1<<(n+m))-1;i++)
{
int j=0;
while (f[++j]!=0) f[j]=0;
f[j]=1;
for (int j=1;j<=n+m;j++)
cout<<f[j]<<" ";
long long s=0;
for (int j=1;j<=n;j++)
for (int k=1;k<=m;k++)
{
if (f[j]+f[n+k]==1) s-=v[j][k];
else s+=v[j][k];
}
cout <<s<<" ";
cout<<'\n';
if (s>mx) mx=s;
}
fout<<mx;
return 0;
}