Cod sursa(job #1005364)
| Utilizator | Data | 4 octombrie 2013 21:30:31 | |
|---|---|---|---|
| Problema | Fractii | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,n,m,a[1000],x,j,s,sum;
int main()
{f>>n>>m;
for(i=1;i<=n*m;i++)f>>a[i];
for(i=1;i<=(1<<n);i++){
x=i;
s=0;
for(j=1;j<=n*m;j++){
if(x%2==1){if(a[j]>0)s=s+a[j];
if(a[j]<0)s=s+a[j]*-1;
}
x/=2;
}
if(s>sum)sum=s;
}
g<<sum;
return 0;
}
