Cod sursa(job #1768595)
Utilizator | Lungu Ionut Lungu007 | Data | 1 octombrie 2016 11:18:52 |
---|---|---|---|
Problema | Jocul Flip | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.89 kb |
#include <iostream>
#include <fstream>
#define NMAX 17
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int a[NMAX][NMAX],n,m;
long long sum,x,y,sumMax;
int main()
{
in >> n >> m;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
in >> a[i][j];
}
}
for(int k=0;k<(1<<m);k++)
{
sum = 0;
for(int i=0;i<n;i++)
{
x = 0;
for(int j=0;j<m;j++)
{
if((1<<j) & k)
{
x -=a[i][j];
}
else
{
x+=a[i][j];
}
}
if(x<0) x=(-1)*x;
sum +=x;
}
if(sumMax<sum)
{
sumMax = sum;
}
}
out << sumMax;
return 0;
}