Pagini recente » Istoria paginii info-oltenia-2019/echipe/9-10 | Cod sursa (job #1314218) | Cod sursa (job #1219438) | Cod sursa (job #1815519) | Cod sursa (job #2788104)
#include <stdio.h>
int main() {
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
int n, m, i, j, k, a[17][17] = {}, s, ans;
scanf("%d%d", &n, &m);
for(i = 1; i <= n; ++i)
for(j = 1; j <= m; ++j) {
scanf("%d", &a[i][j]);
a[i][0] += a[i][j];
a[0][j] += a[i][j];
a[0][0] += a[i][j];
}
ans = a[0][0];
for(k = 1; k < 1<<(n+m); ++k) {
s = a[0][0];
for(i = 1; i <= n; ++i)
if(k & (1 << (i-1)))
s -= a[i][0] << 1;
for(j = 1; j <= m; ++j)
if(k & (1 << (j-1+n)))
s -= a[0][j] << 1;
if(s > ans)
ans = s;
}
printf("%d\n", ans);
}