Pagini recente » Cod sursa (job #1897453) | Cod sursa (job #67986) | Cod sursa (job #2010823) | Cod sursa (job #2343123) | Cod sursa (job #2447423)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream input;
input.open("flip.in");
int n, m;
input >> n >> m;
int max = 0;
int numere[n][m];
int sum = 0;
for (int a=0; a < n; a++) {
for (int b=0; b < m; b++) {
input >> numere[a][b];
sum += numere[a][b];
}
}
for (int a=0; a < n; a++) {
for (int b=0; b < m; b++) {
int suma = sum;
for (int c=0; c < n; c++) {
suma -= 2 * numere[c][b];
}
for (int d=0; d < m; d++) {
suma -= 2 * numere[a][d];
}
suma += 2 * numere[a][b];
if (suma > max) {
max = suma;
}
}
}
ofstream output;
output.open("flip.out");
output << max;
return 0;
}