Pagini recente » Cod sursa (job #2319779) | Cod sursa (job #79062) | Cod sursa (job #1507654) | Cod sursa (job #2845036) | Cod sursa (job #2446771)
#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];
for (int a=0; a < n; a++) {
for (int b=0; b < m; b++) {
input >> numere[a][b];
}
}
for (int a=0; a < n; a++) {
for (int b=0; b < m; b++) {
int suma = 0;
for (int c=0; c < n; c++) {
for (int d=0; d < m; d++) {
if (a == c || b == d) {
suma -= numere[c][d];
} else {
suma += numere[c][d];
}
}
}
if (suma > max) {
max = suma;
}
}
}
ofstream output;
output.open("flip.out");
output << max;
return 0;
}