Cod sursa(job #318716)
| Utilizator | Data | 29 mai 2009 08:21:20 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.8 kb |
#include<stdio.h>
#include<conio.h>
using namespace std;
int N,M,sol[20],Sf,v[20][20];
void calc()
{
int S,Q=0;
for(int i=1;i<=N;++i)
{
S=0;
for(int i2=1;i2<=M;++i2)
{
S=S+(v[i][i2]*sol[i2]);
}
if(S<0)
S=-S;
Q=Q+S;
}
if(Q>Sf)
Sf=Q;
}
void back(int k)
{
if(k==M)
{
calc();
}
else
sol[k]=-1;
back(k+1);
sol[k]=1;
back(k+1);
}
int main()
{
scanf("%d %d",&N,&M);
for(int i=1;i<=N;++i)
for(int i2=1;i2<=M;++i2)
scanf("%d",&v[i][i2]);
back(1);
printf("%d",Sf);
getch();
return 0;
}
