Pagini recente » Cod sursa (job #471550) | Cod sursa (job #2735039) | Cod sursa (job #885287) | Cod sursa (job #852005) | Cod sursa (job #2605144)
#include <stdio.h>
#include <stdlib.h>
int n,m,sol;
int a[17][17],sum[17];
int max(int a, int b) {
return (a > b) ? a : b;
}
int main() {
int k;
FILE* in = fopen("flip.in", "r");
FILE* out = fopen("flip.out", "w");
fscanf(in, "%d %d", &n, &m);
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
fscanf(in, "%d", &a[i][j]);
for(int i=0; i < (1 << n); i++) {
for(int j=1; j<=m; j++)
sum[j]=0;
for(k=0; k<n; k++) {
if( i&(1<<k) ) {
printf("aa:%d %d\n", i, k);
for(int j=1; j<=m; j++)
sum[j]+=a[k+1][j];
} else {
printf("bb:%d %d\n", i, k);
for(int j=1; j<=m; j++)
sum[j]-=a[k+1][j];
}
}
for(int j = 1; j <= m; j++)
printf("%d ", sum[j]);
printf("\n");
int Max=0;
for(int j=1; j<=m; j++)
Max+=abs(sum[j]);
sol=max(sol,Max);
}
fprintf(out, "%d", sol);
return 0;
}