Pagini recente » Cod sursa (job #1786792) | Cod sursa (job #2382495) | Cod sursa (job #945791) | Cod sursa (job #162001) | Cod sursa (job #973765)
Cod sursa(job #973765)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("filip.in");
ofstream g("filip.out");
int n,m,a[101][101],i,j,k,sp,sn,s;
int main()
{
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++)
{
sp=0;sn=0;
for (j=1;j<=m;j++)
{
if (a[i][j]>0) sp+=a[i][j];
else sn-=a[i][j];
}
if (sp-sn<0)
for (k=1;k<=m;k++)
a[i][k]*=(-1);
}
for (i=1;i<=m;i++)
{
sp=0;sn=0;
for (j=1;j<=n;j++)
{
if (a[i][j]>0) sp+=a[j][i];
else sn-=a[j][i];
}
if (sp-sn<0)
for (k=1;k<=n;k++)
a[k][i]*=(-1);
}
for (i=1;i<=n;i++)
{
for (j=1;j<=m;j++)
s+=a[i][j];
}
g<<s;
f.close();
g.close();
return 0;
}