Pagini recente » Cod sursa (job #1549843) | Cod sursa (job #725534) | Cod sursa (job #303301) | Cod sursa (job #3250403) | Cod sursa (job #19428)
Cod sursa(job #19428)
#include<fstream.h>
int main()
{int m,n,i,j,sp,sn,max=0;
long int a[100][100];
fstream f("flip.in",ios::in);
fstream g("flip.out",ios::out);
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
if(n>m)
{for(j=1;j<=m;j++)
{sp=0;sn=0;
for(i=1;i<=n;i++)
{if(a[i][j]>0) sp+=a[i][j];
if(a[i][j]<0) sn-=a[i][j];}
if(sn>sp) for(i=1;i<=n;i++) a[i][j]*=-1; }
for(i=1;i<=n;i++)
{sp=0;sn=0;
for(j=1;j<=m;j++)
{if(a[i][j]>0) sp+=a[i][j];
if(a[i][j]<0) sn-=a[i][j];}
if(sn>sp) for(j=1;j<=m;j++) a[i][j]*=-1; }
}
else {for(i=1;i<=n;i++)
{sp=0;sn=0;
for(j=1;j<=m;j++)
{if(a[i][j]>0) sp+=a[i][j];
if(a[i][j]<0) sn-=a[i][j];}
if(sn>sp) for(j=1;j<=m;j++) a[i][j]*=-1; }
for(j=1;j<=m;j++)
{sp=0;sn=0;
for(i=1;i<=n;i++)
{if(a[i][j]>0) sp+=a[i][j];
if(a[i][j]<0) sn-=a[i][j];}
if(sn>sp) for(i=1;i<=n;i++) a[i][j]*=-1; }
};
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
max+=a[i][j];
g<<max;
return 1;
}