Cod sursa(job #2383767)
| Utilizator | Data | 19 martie 2019 19:37:46 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int n,m,sol[16],b[16][16],maxi=0;
int rez()
{
int i,j,s,ans=0;
for(j=0;j<m;j++)
{
s=0;
for(i=0;i<n;i++)
s+=b[i][j]*sol[i];
ans+=abs(s);
}
return ans;
}
void bt(int k)
{
if(k==n)
{
maxi=max(maxi,rez());
}
else
{
for(int i=-1;i<=1;i+=2)
{
sol[k]=i;
bt(k+1);
}
}
}
int main()
{
fin>>n>>m;
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
fin>>b[i][j];
}
bt(0);
fout<<maxi;
return 0;
}
