Pagini recente » Cod sursa (job #2327219) | Cod sursa (job #36531) | Cod sursa (job #1919968) | Cod sursa (job #2557485) | Cod sursa (job #552395)
Cod sursa(job #552395)
#include<fstream.h>
#include<math.h>
int main()
{int i,j,m,n,a[100][100],S1,S2,S;
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];
S=0;
for(i=1;i<=n;i++)
{ S1=0; S2=0;
for(j=1;j<=m;j++)
if(a[i][j]<0) S1=S1+a[i][j];
else S2=S2+a[i][j];
if (abs(S1)>S2) S=abs(S1)-S2;
else S=S2-abs(S1);
}
for(j=1;j<=m;j++)
{ S1=0; S2=0;
for(i=1;i<=n;i++)
if(a[i][j]<0) S1=S1+a[i][j];
else S2=S2+a[i][j];
if (abs(S1)>S2) S=abs(S1)-S2;
else S=S2-abs(S1);
}
g<<S;
f.close();
g.close();
return 0;
}