Pagini recente » Cod sursa (job #3154800) | Cod sursa (job #2119676) | Cod sursa (job #2320367) | Cod sursa (job #144132) | Cod sursa (job #999836)
Cod sursa(job #999836)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,n,k,l,j,m,a[17][17],s1[17],o,ok,h,t,s2[17],s,mini=((1<<31)-1);
void flip(int k,int l)
{
o=s;
j=s1[k]+s2[l]-a[k][l];
if (j<=mini) mini=j;
while (ok==0)
{
if (k<n && l==m) k++,l=0;
if (k==n && l==m-1) ok=1;
flip(k,l+1);
}
}
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>a[i][j],s+=a[i][j],s1[i]+=a[i][j],s2[j]+=a[i][j];
flip(1,1);
g<<s+(-2)*mini;
return 0;
}