Pagini recente » Cod sursa (job #570130) | Cod sursa (job #1864289) | Cod sursa (job #1201865) | Cod sursa (job #1082208) | Cod sursa (job #1972106)
#include <stdio.h>
#include <iostream>
#define MAX 16
using namespace std;
int A[MAX][MAX], C[MAX], Cv[MAX], Max;
int total(int n, int m) //suma
{
int suma, i, j;
suma = 0;
for(i = 0; i < m; i++)suma += C[i];
return suma;
}
void bkt(int n, int m, int k)
{
int suma, i;
if(k == n)//verificare
{
for(i = 0; i < m; i++)
if(C[i] < 0)
{
C[i] *= -1;
Cv[i] = 1;
}
suma = total(n, m);
if(Max < suma)Max = suma;
for(i = 0; i < m; i++)
if(Cv[i] == 1)
{
Cv[i] = 0;
C[i] *= -1;
}
}
else
{
for(i = 0; i < m; i++)C[i] -= 2 * A[k][i];
bkt(n, m, k + 1);
for(i = 0; i < m; i++)C[i] += 2 * A[k][i];
bkt(n, m, k + 1);
}
}
int main()
{
FILE *fin, *fout;
int n, m, i, j;
fin = fopen("flip.in", "r");
fout = fopen("flip.out", "w");
fscanf(fin, "%d%d", &n, &m);
for(i = 0; i < n; i++)
for(j = 0; j < m; j++)
{
fscanf(fin, "%d", &A[i][j]); //citirea
C[j] += A[i][j];
}
bkt(n, m, 0); //bkt
fprintf(fout, "%d", Max);
fclose( fin );
fclose( fout );
return 0;
}