Cod sursa(job #2242025)
| Utilizator | Data | 17 septembrie 2018 16:39:46 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.78 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int v[17][17];
int main()
{
int n,m,i,j,k,s,s1,maxcur=0,max1=0,val;
in>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
in>>v[i][j];
for(i=0; i<(1<<n); i++)
{
maxcur=0;
for(k=1; k<=m; k++)
{
s=0;
s1=0;
for(j=1; j<=n; j++)
{
val=v[j][k];
if((1<<j)&i)
val=0-v[j][k];
if(val>0)
s+=val;
else
s1+=0-val;
}
maxcur+=fabs(s-s1);
}
max1=max(max1,maxcur);
}
out<<max1;
return 0;
}
