Pagini recente » Cod sursa (job #819044) | Cod sursa (job #2184775) | Cod sursa (job #2896520) | Cod sursa (job #2260881) | Cod sursa (job #2642487)
#include <iostream>
#include <fstream>
using namespace std;
int maxFlip(int mat[18][18], int n, int m) {
int sum = 0;
int aux1 = 0;
int aux2 = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
aux1 += mat[i][j];
aux2 += -mat[i][j];
}
if (aux1 < aux2) {
for (int j = 0; j < m; j++) {
mat[i][j] = -mat[i][j];
}
}
aux1 = aux2 = 0;
}
for (int j = 0; j < m; j++) {
for (int i = 0; i < n; i++) {
aux1 += mat[i][j];
aux2 += -mat[i][j];
}
if (aux1 < aux2) {
for (int i = 0; i < n; i++) {
mat[i][j] = -mat[i][j];
}
}
aux1 = aux2 = 0;
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
sum += mat[i][j];
}
}
return sum;
}
int main() {
int n, m;
int mat[18][18];
// Citire
ifstream inf("flipIn.TXT");
inf >> n;
inf >> m;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
inf >> mat[i][j];
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cout << mat[i][j] << " ";
}
cout << endl;
}
// Testare
int sum = maxFlip(mat, n, m);
cout << "Rezultatul este: " << sum;
ofstream outf("fisierOut.TXT");
outf << sum;
return 0;
}