Pagini recente » Cod sursa (job #220773) | Cod sursa (job #109290) | Monitorul de evaluare | Cod sursa (job #668266) | Cod sursa (job #2727579)
#include <fstream>
#include <iostream>
#include <climits>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int main()
{
int a[16][16];
int n, m, ossz = 0, min = INT_MAX;
in >> n >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
in >> a[i][j];
ossz += a[i][j];
}
if (ossz < 0) {
for (int j = 0; j < m; j++) {
a[i][j] = -a[i][j];
}
}
ossz = 0;
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
ossz += a[j][i];
}
if (ossz < 0) {
for (int j = 0; j < n; j++) {
a[j][i] = -a[j][i];
}
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
out << a[i][j] << " ";
}
out << "\n";
}
return 0;
}