Pagini recente » Cod sursa (job #525224) | Cod sursa (job #918568) | Cod sursa (job #334227) | Cod sursa (job #3255563) | Cod sursa (job #1259349)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("flip.in");
ofstream f1("flip.out");
long A[17][17];
long long s=0,sp,sn;
int i,j,n,m;
f>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
f>>A[i][j];
for (i=1;i<=n;i++)
{
sn=sp=0;
for (j=1;j<=m;j++)
if (A[i][j]<0) sn+=A[i][j];
else sp+=A[i][j];
if (sn*(-1)>sp)
{
for (j=1;j<=m;j++)
A[i][j]=A[i][j]*(-1);
}
}
for (i=1;i<=m;i++)
{
sn=sp=0;
for (j=1;j<=n;j++)
if (A[j][i]<0) sn+=A[j][i];
else sp+=A[j][i];
if (sn*(-1)>sp)
{
for (j=1;j<=n;j++)
A[j][i]=A[j][i]*(-1);
}
}
for (i=1;i<=n;i++)
{
sn=sp=0;
for (j=1;j<=m;j++)
if (A[i][j]<0) sn+=A[i][j];
else sp+=A[i][j];
if (sn*(-1)>sp)
{
for (j=1;j<=m;j++)
A[i][j]=A[i][j]*(-1);
}
}
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
s+=A[i][j];
f1<<s;
}