Pagini recente » Cod sursa (job #2851808) | Cod sursa (job #369413) | Cod sursa (job #2430205) | Cod sursa (job #634397) | Cod sursa (job #825499)
Cod sursa(job #825499)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main(){
FILE *fp, *fr;
int m, n, result = 0, i, j, suma = 0, previousI = -1;
int a[16][16];
fp = fopen("flip.in","r");
fr = fopen("flip.out", "w");
fscanf(fp, "%d", &m);
fscanf(fp, "%d", &n);
fscanf(fp, "\n");
for(i = 0; i < m; i++){
for(j = 0; j < n; j++){
fscanf(fp, "%d", &a[i][j]);
}
fscanf(fp, "\n");
}
/*for(i = 0; i < m; i++){
for(j = 0; j < n; j++){
printf("%d ", a[i][j]);
}
printf("\n");
}*/
printf("\n");
for(i = 0; i < m; i++){
for(j = 0; j < n; j++){
if(previousI == i) {
a[i][j] = 0 - a[i][j];
} else {
suma = suma + a[i][j];
}
}
if(suma < 0) {
previousI = i;
i--;
}
suma = 0;
}
for(i = 0; i < n; i++){
for(j = 0; j < m; j++){
if(previousI == i) {
a[j][i] = 0 - a[j][i];
} else {
suma = suma + a[j][i];
}
}
if(suma < 0) {
previousI = i;
i--;
}
suma = 0;
}
for(i = 0; i < m; i++){
for(j = 0; j < n; j++){
result += a[i][j];
}
}
fprintf(fr, "%d", result);
fclose(fp);
fclose(fr);
return 0;
}