Pagini recente » Cod sursa (job #84997) | Cod sursa (job #1686) | Cod sursa (job #2317982) | Cod sursa (job #2332148) | Cod sursa (job #1321365)
#include <fstream>
#include <cmath>
#include <cstdio>
using namespace std;
FILE *f,*g;
int ma[16][16];
int m,n;
unsigned smax=0;
int main ()
{
f = fopen("flip.in","r");
g = fopen("flip.out","w");
fscanf(f,"%d %d",&n,&m);
for(int i = 0 ; i < n ; i++) {
for(int j = 0 ; j < m ; j++) {
fscanf(f,"%d",&ma[i][j]);
}
}
int s1,s2;
for(int i = 0 ; i < pow(2,n) ; i++) {
s1 = 0;
for(int j = 0 ; j < m ; j++) {
s2 = 0;
for(int k = 0 ; k < n ; k++) {
if((i>>k)%2==1)
s2+=ma[k][j];
else
s2-=ma[k][j];
}
s1 += abs(s2);
}
if(s1 > smax)
smax = s1;
}
fprintf(g,"%d\n",smax);
return 0;
}