Pagini recente » Cod sursa (job #1108271) | Cod sursa (job #603232) | Cod sursa (job #587410) | Cod sursa (job #3040765) | Cod sursa (job #1041247)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long su,n,m,i,j,s[1001],a[1001][1001],v[1001];
int main()
{f>>n;
f>>m;
su=0;
for(i=1;i<=n;i++)
{s[i]=0;
for(j=1;j<=m;j++)
{f>>a[i][j];
s[i]=s[i]+a[i][j];
}
if (s[i]<0)
for(j=1;j<=m;j++)
a[i][j]=a[i][j]-2*a[i][j];
}
for (j=1;j<=m;j++)
{v[j]=0;
for (i=1;i<=n;i++)
v[j]=v[j]+a[i][j];
if (v[j]<0)
su=su+v[j]-2*v[j];
else
su=su+v[j];
}
g<<su;
return 0;
}