Pagini recente » Cod sursa (job #1966071) | Cod sursa (job #2474220) | Cod sursa (job #2317678) | Cod sursa (job #2035788) | Cod sursa (job #12785)
Cod sursa(job #12785)
#include "stdio.h"
#include "math.h"
int N, M;
int a[16][16], b[16][16];
char binar[17];
void reprez_binar(int n)
{
int k=0;
for(int i=0; i<N; i++)
binar[i] = '0';
while(n)
{
if(n%2==1)
binar[N-1-k] = '1';
n=n/2;
k++;
}
binar[N]='\0';
}
void comuta_row(int row)
{
int col;
for(col=0; col<M; col++)
b[row][col] *= -1;
}
void comuta_col(int col)
{
int row;
for(row=0; row<N; row++)
b[row][col] *= -1;
}
int suma(void)
{
int row, col;
int suma = 0;
for(row=0; row<N; row++)
for(col=0; col<M; col++)
{
suma += b[row][col];
}
return suma;
}
int main(void)
{
FILE *fin, *fout;
int i,j, pow=1, k;
if((fin = fopen("flip.in", "r"))==NULL)
return -1;
if((fout = fopen("flip.out", "w"))==NULL)
return -1;
fscanf(fin, "%d %d", &N, &M);
for(k=0;k<N;k++)
pow *= 2;
for(i=0; i<N; i++)
{
for(j=0; j<M; j++)
{
fscanf(fin, "%d", &a[i][j]);
b[i][j] = a[i][j];
}
}
int sum_max = suma();
for(k=1; k<pow; k++)
{
reprez_binar(k);
for(i=0; binar[i] != '\0'; i++)
{
if(binar[i] == '1')
comuta_row(i);
}
for(j=0; j<M; j++)
{
int s=0;
for(i=0; i<N; i++)
s+=b[i][j];
if(s<0)
comuta_col(j);
}
int sum = suma();
if(sum_max<sum)
sum_max = sum;
if(k==pow-1)
break;
for(i=0;i<N;i++)
for(j=0; j<M; j++)
b[i][j] = a[i][j];
}
fprintf(fout, "%d\n", sum_max);
fclose(fin);
fclose(fout);
return 0;
}