Pagini recente » Cod sursa (job #2730628) | Cod sursa (job #1494746) | Cod sursa (job #1149617) | Istoria paginii info-oltenia-2019/echipe/9-10 | Cod sursa (job #1907720)
#include <iostream>
#include <fstream>
using namespace std;
int n, m, i, j, v[20][10],x;
int sneg, spoz;
int main () {
ifstream fin("flip.in");
ofstream fout("flip.out");
fin >> n >> m;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
fin >> v[i][j];
for (j = 1; j <= m; j++)
{
sneg = 0; spoz = 0;
for (i = 1; i <= n; i++)
{
if (v[i][j] < 0) sneg += v[i][j];
if (v[i][j] > 0) spoz += v[i][j];
}
if (sneg*(-1) > spoz)
for (i = 1; i <= n; i++)
v[i][j] *= -1;
}
for (i = 1; i <= n; i++)
{
sneg = 0; spoz = 0;
for (j = 1; j <= m; j++)
{
if (v[i][j] < 0) sneg += v[i][j];
if (v[i][j] > 0) spoz += v[i][j];
}
if (sneg*(-1) > spoz)
for (j = 1; j <= m; j++)
v[i][j] *= -1;
}
sneg = 0;
for (i = 1; i <= n; i++)
{
for (j = 1; j <= m; j++)
{ cout << v[i][j] << " "; sneg += v[i][j]; }
cout << "\n";
}
fout << sneg << "\n";
}
/*
4 -2 2
3 -1 5
2 0 -3
4 1 -3
5 -3 2
*/