Pagini recente » Cod sursa (job #957888) | Cod sursa (job #1258227) | Cod sursa (job #1993373) | Cod sursa (job #2099102) | Cod sursa (job #2044296)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int mat[17][17], n, m, S[41], rz;
int rez(){
int s = 0, rasp = 0;
for(int i = 1; i <= n; i++){
s = 0;
for(int j =1; j <= m; j++)
s+=S[j] * mat[i][j];
rasp+=max(s, -s);
}
return rasp;
}
void bkt(int niv){
if(niv > m)
{
rz = max(rz, rez());
return;
}
S[niv] = 1;
bkt(niv + 1);
S[niv] = - 1;
bkt(niv + 1);
}
int main()
{
fin >> n >> m;
for(int i = 1; i <= n ; i++)
{
for(int j = 1; j <= m; j++)
fin >> mat[i][j], rz +=mat[i][j];
}
bkt(1);
fout<<rz;
return 0;
}