Pagini recente » Cod sursa (job #462345) | Cod sursa (job #3333647) | Cod sursa (job #2586512) | Monitorul de evaluare | Cod sursa (job #3307019)
#include <stdio.h>
const int MAX_N = 16;
const int MAX_M = 16;
const int INF = 2e9;
int mat[MAX_N][MAX_M];
int col_sum[MAX_M];
int main() {
FILE *fin = fopen("flip.in", "r");
FILE *fout = fopen("flip.out", "w");
int n, m;
fscanf(fin, "%d%d", &n, &m);
for(int l = 0; l < n; l++) {
for(int c = 0; c < m; c++) {
fscanf(fin, "%d", &mat[l][c]);
}
}
int res = -INF;
for(int mask = 0; mask < (1 << n); mask++) {
for(int c = 0; c < m; c++) {
col_sum[c] = 0;
}
for(int l = 0; l < n; l++) {
bool toggle = (mask >> l) & 1;
for(int c = 0; c < m; c++) {
col_sum[c] += (1 - 2 * toggle) * mat[l][c];
}
}
int sum = 0;
for(int c = 0; c < m; c++) {
sum += (col_sum[c] < 0 ? -col_sum[c] : col_sum[c]);
}
printf("%d %d\n", mask, sum);
if(sum > res) {
res = sum;
}
}
fprintf(fout, "%d\n", res);
fclose(fin);
fclose(fout);
return 0;
}