Pagini recente » Cod sursa (job #870204) | Cod sursa (job #2509338) | Cod sursa (job #529578) | Diferente pentru problema/rayman intre reviziile 22 si 23 | Cod sursa (job #1565905)
#include <fstream>
using namespace std;
int main()
{ int n, m, a[20][20], i, j, s;
ifstream fin ("flip.in");
ofstream fout ("flip.out");
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++)
{
s=0;
for (j=1; j<=m; j++)
{
s=s+a[i][j];
}
if (s<0)
for (j=1; j<=m; j++)
{
a[i][j]=a[i][j]*(-1);
}
}
for (j=1; j<=m; j++)
{
s=0;
for (i=1; i<=n; i++)
{
s=s+a[i][j];
}
if (s<0)
for (i=1; i<=n; i++)
{
a[i][j]=a[i][j]*(-1);
}
}
s=0;
for (i=1; i<=n; i++)
{
for (j=1; j<=m; j++)
{
s=s+a[i][j];
}
}
fout << s << "\n";
fin.close();
fout.close();
return 0;
}