Pagini recente » Cod sursa (job #2623666) | Cod sursa (job #325335) | Monitorul de evaluare | Cod sursa (job #1108801) | Cod sursa (job #1231983)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int j, i, n, m, s, a[100][100];
int main()
{
fin >> n >> m;
for (i=0; i<n; i++)
{
for (j=0; j<m; j++)
{
fin >> a[i][j];
}
}
fin.close();
j = 0;
for (i=0; i<n; i++)
{
a[i][j] = a[i][j]*(-1);
}
int smax = 0;
for (i=0; i<n; i++)
{
s = 0;
for (j=0; j<m; j++)
{
s = s + a[i][j];
}
if (s < 0)
{
s = 0;
for (j=0; j<m; j++)
{
s = s + a[i][j] * (-1);
}
}
cout << s << " ";
smax += s;
}
fout << smax;
fout.close();
return 0;
}