Pagini recente » Cod sursa (job #2110855) | Cod sursa (job #921778) | Cod sursa (job #704663) | Cod sursa (job #1266013) | Cod sursa (job #1820333)
#include <cstdio>
#define nmax 16
int a[nmax+5][nmax+5];
int N;
int main()
{
freopen("flip.in", "r", stdin);
freopen("flip.out", "w", stdout);
scanf("%d", &N);
int i, j;
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++)
scanf("%d", &a[i][j]);
int max_sum = 0;
for (int binary = 0; binary < (1 << (2*N)); binary++)
{
int s = 0;
for (i = 1; i <= N; i++)
for (j = 1; j <= N; j++)
if ((binary & (1 << i)) == (binary & (1 << j)))
s += a[i][j];
else
s -= a[i][j];
if (s > max_sum)
max_sum = s;
}
printf("%d", max_sum);
return 0;
}