Pagini recente » Cod sursa (job #1593266) | Cod sursa (job #687799) | Cod sursa (job #1622439) | Cod sursa (job #2624735) | Cod sursa (job #504144)
Cod sursa(job #504144)
#include<fstream>
#include<iostream>
#define nmax 20
using namespace std;
int a[nmax][nmax], v[nmax];
int main() {
ifstream f("flip.in");
ofstream g("flip.out");
int m, n, max = -300000000;
f >> n >> m;
int i, j;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
f >> a[i][j];
int l = 1<<n;
for (i = 0; i < l; i++) {
for (int i1 = 1; i1 <= n; i1++)
v[i1] = 1;
for (int x = i, j = 1; x > 0; x>>=1, j++) {
if ((x&1) == 0)
v[j] = -1;
}
int s = 0;
for (int i1 = 1; i1 <= m; i1++){
int s1 = 0;
for (int j1 = 1; j1 <= n; j1++){
s1 = s1+a[j1][i1]*v[j1];
}
s = s + abs(s1);
}
cout << s << " ";
if (s > max)
max = s;
}
g << max << '\n';
return 0;
}