Pagini recente » Cod sursa (job #54735) | Cod sursa (job #1924730) | Cod sursa (job #1440661) | Cod sursa (job #3288525) | Cod sursa (job #2938986)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int main()
{
long long a[20][20], m, n, i, j, s = 0, s1, s2;
fin >> n >> m;
for (i = 1; i <= n; i ++)
for (j = 1; j <= m; j ++)
fin >> a[i][j];
for (i = 1; i <= n; i ++)
{
s1 = 0;
s2 = 0;
for (j = 1; j <= m; j ++)
{
if (a[i][j] > 0)
s1 += a[i][j];
else
s2 += a[i][j];
}
if (s1 > s2)
s += s1;
else
s += -s2;
}
fout << s;
return 0;
}