Pagini recente » Borderou de evaluare (job #1229488) | Cod sursa (job #506454) | Cod sursa (job #2975236) | Cod sursa (job #413773) | Cod sursa (job #515173)
Cod sursa(job #515173)
#include <stdio.h>
#define nmax 17
int N, M, A[nmax][nmax], i, j, s;
int main()
{
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
scanf("%d %d", &N, &M);
for(i=1; i<=N; i++)
for(j=1; j<=M; j++)
scanf("%d", &A[i][j]);
for(i=1; i<=N; i++)
{ s=0;
for(j=1; j<=M; j++)
s+=A[i][j];
if(s<0)
for(j=1; j<=M; j++)
A[i][j]*=-1;
}
for(j=1; j<=M; j++)
{ s=0;
for(i=1; i<=N; i++)
s+=A[i][j];
if(s<0)
for(i=1; i<=N; i++)
A[i][j]*=-1;
}
s=0;
for(i=1; i<=N; i++)
for(j=1; j<=M; j++)
s=s+A[i][j];
printf("%d\n", s);
return 0;
}