Pagini recente » Cod sursa (job #448240) | Cod sursa (job #280817) | Cod sursa (job #1475532) | Cod sursa (job #1689394) | Cod sursa (job #973576)
Cod sursa(job #973576)
#include<fstream>
#include<iostream>
using namespace std;
int main()
{
long a[50][50],m,n,i,j,sp,sn,ok=0;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
do
{
ok=1;
for(i=1;i<=n;i++)
{
sp=0;sn=0;
for(j=1;j<=m;j++)
if(a[i][j]>=0)
sp=sp+a[i][j];
else
sn=sn+a[i][j];
if(sn*-1>sp)
{for(j=1;j<=m;j++)
a[i][j]=a[i][j]*-1;
ok=0;
}
}
for(j=1;j<=m;j++)
{
sp=0;sn=0;
for(i=1;i<=n;i++)
if(a[i][j]>=0)
sp=sp+a[i][j];
else
sn=sn+a[i][j];
if(sn*-1>sp)
{for(i=1;i<=n;i++)
a[i][j]=a[i][j]*-1;
ok=0;
}
}
}
while(ok==0);
sp=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
sp=sp+a[i][j];
g<<sp;
return 0;
}