Pagini recente » Cod sursa (job #2228470) | Cod sursa (job #708258) | Cod sursa (job #1270668) | Cod sursa (job #862633) | Cod sursa (job #2485726)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
int v[20][20],i,j;
ifstream in("flip.in");
ofstream out("flip.out");
int main(){
int n,m,sumabarosana;
in >>n>>m;
int x[n+m+1]={0};
for ( i=1;i<=n;i++)
for ( j=1;j<=m;j++){
in >>v[i][j];
sumabarosana+=v[i][j];}
int s;
while (x[0]==0){
s=0;
for ( i=1;i<=n;i++){
for ( j=1;j<=m;j++){
if (x[j+n]==1 || x[i]==1){
if (x[j+n]==1 && x[i]==1){s+=v[i][j];}else{s-=v[i][j];}
}
}
}
sumabarosana=max(s,sumabarosana);
for(i=m+n;x[i]==1;i--)
{
x[i]=0;
}
x[i]++;
}
out <<sumabarosana;
}