Cod sursa(job #11668)
Utilizator | Maria Stanciu sigrid | Data | 1 februarie 2007 08:54:10 |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream.h>
long n,m,a[16][16],i,j,k,t,s,smax;
int main()
{ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{f>>a[i][j];}
f.close();
for(i=0;i<(1<<m);i++)
{s=0;
for(k=0;k<n;k++)
{for(t=j=0;j<m;j++)
if(i&1<<j) t+=-a[k][j];
else t+=a[k][j];
s+=t<-t ? -t:t;
}
if(smax<s) {smax=s;}
}
g<<smax<<'\n';
g.close();
return 0;
}