Pagini recente » Cod sursa (job #2095778) | Cod sursa (job #1784795) | Cod sursa (job #1781265) | Cod sursa (job #47033) | Cod sursa (job #1790766)
#include <stdio.h>
int n,v[20],a[20][20],n,m,maxim;
void bkt(int k){
int i=0; int j=0;
if(k==n+1){
int sum_totala=0;
int sum_coloana=0;
for(j=1;j<=m;j++){
sum_coloana=0;
for(i=1;i<=n;i++){
if(v[i]==1)
sum_coloana-=a[i][j];
else sum_coloana+=a[i][j];
}
if(sum_coloana<0)
sum_coloana=(-1)*sum_coloana;
sum_totala+=sum_coloana;
}
if(sum_totala>maxim)
maxim=sum_totala;
return;}
for(i=0;i<=1;i++){
v[k]=i;
bkt(k+1);
}
}
int main(){
scanf("%d %d",&n,&m);
int i=0; int j=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%d",&a[i][j]);
bkt(1);
printf("%d",maxim);
return 0;}