Pagini recente » Cod sursa (job #1066686) | Cod sursa (job #497690) | Cod sursa (job #2958120) | Cod sursa (job #7735) | Cod sursa (job #938813)
Cod sursa(job #938813)
#include <iostream>
#include <stdio.h>
#include <math.h>
using namespace std ;
int v[17][17];
int n, m;
void citire(){
freopen("adunare.in","r",stdin);
cin >> n >> m ;
for (int i = 0 ; i < n ; i++)
for (int j = 0 ; j < m ; j++)
cin >> v[i][j] ;
}
int main(){
int max = 0, sum, s, sfarsit, lini[17] , k ;
citire();
sfarsit = pow(2,n) ;
for (int j,i = 0; i < sfarsit ; i++){
k = i ;
for (j = 0 ; j < n ; j++) {
lini[j] = k % 2 == 0 ? 1 : -1 ;
k = k / 2 ;
}
sum = 0 ;
for (int i = 0 ; i < n ; i++){
s = 0 ;
for (int j = 0 ; j < m ; j++)
s+= v[i][j]*lini[j];
if (s < 0) {sum -=s ;}
else {sum +=s;}
}
if (max < sum) max =sum ;
}
freopen("adunare.out","w",stdout);
cout << max ;
return 0 ;
}