Cod sursa(job #284268)
Utilizator | Temian Vlad monk | Data | 21 martie 2009 14:40:31 |
---|---|---|---|
Problema | Jocul Flip | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream.h>
void main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int a[100][100],s,max=0,j,i,m,n,x;
f>>n>>m;
for(i=1;i<=n;i++){s=0;
for(j=1;j<=m;j++){
f>>x;
a[i][j]=x;
s+=x;
}
if(s<0)
for(j=1;j<=m;j++)a[i][j]=-a[i][j];}
for(i=1;i<=m;i++){s=0;
for(j=1;j<=n;j++)
s+=a[j][i];
if(s>=0)max+=s;
else
max+=-s;
}
g<<max;
}