Pagini recente » Cod sursa (job #593915) | Istoria paginii runda/infostar/clasament | Cod sursa (job #1890741) | Cod sursa (job #1480583) | Cod sursa (job #1191584)
#include <stdio.h>
int main()
{
FILE *f_in = fopen("flip.in", "r");
FILE *f_out = fopen("flip.out", "wt");
int M,N;
fscanf(f_in, "%d %d", &N, &M);
int A[N][M];
int i, j;
int sum = 0;
for (i=0 ; i<N ; i++)
for(j=0 ; j<M ; j++)
fscanf(f_in, "%d", &A[i][j]);
int max1, max2;
for(i=0 ; i<N ; i++)
{
max1=0; max2=0;
for(j=0 ; j<M ; j++)
if(A[i][j] > 0)
max1 +=A[i][j];
else
max2 +=A[i][j];
if(abs(max2)>max1)
for(j=0 ; j<M ; j++)
A[i][j] = -A[i][j];
}
for(j=0 ; j<M ; j++)
{
max1=0; max2=0;
for(i=0 ; i<N ; i++)
if(A[i][j] > 0)
max1 +=A[i][j];
else
max2 +=A[i][j];
if(abs(max2)>max1)
for(i=0 ; i<N ; i++)
A[i][j] = -A[i][j];
}
for(i=0 ; i<N ; i++)
for(j=0 ; j<M ; j++)
sum +=A[i][j];
fprintf(f_out, "%d", sum);
close(f_out);
close(f_in);
}