Pagini recente » Cod sursa (job #1071434) | Cod sursa (job #2406108) | Cod sursa (job #1872817) | Cod sursa (job #475678) | Cod sursa (job #222935)
Cod sursa(job #222935)
#include<stdio.h>
long long n,k,ev,as,s,Ts[17],m,a[17][17],st[100];
FILE*in = fopen("flip.in","r");
FILE*out= fopen("flip.out","w");
void init(){
st[k]=-1;
}
int succesor(){
if(st[k]<1){
st[k]++;
return 1;
}else
return 0;
}
int valid(){
return 1;
}
int solutie(){
return k==m;
}
void tipar(){
int i,j;
for(i=1;i<=n;i++){
s=0;
for(j=1;j<=m;j++)
if(st[j] == 0) s += a[i][j];
else s-=a[i][j];
if(s>Ts[i])Ts[i] = s;
}
}
void bt(){
k=1;
init();
while(k){
as=1;ev=0;
while(as && !ev){
as=succesor();
if(as) ev=valid();
}
if(as)
if(solutie()){tipar();}
else{k++;init();}
else
k--;
}
}
int main(){
int i,j;
fscanf(in,"%lld%lld", &n,&m);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fscanf(in,"%lld", &a[i][j]);
bt();
s=0;
for(i=1;i<=n;i++)
s+=Ts[i];
fprintf(out, "%lld",s);
return 0;
}