Pagini recente » Cod sursa (job #2062398) | Cod sursa (job #2263380) | Cod sursa (job #2740040) | Cod sursa (job #3286730) | Cod sursa (job #2651137)
#include <iostream>
#include <fstream>
using namespace std;
int main() {
int N, M, a[50][50],minl=INT_MAX,minc=INT_MAX,sfinal=0,smax=0;
ifstream f("flip.in");
ofstream g("flip.out");
f >> N>>M;
for (int i = 0;i < N;i++)
{
for (int j = 0;j < M;j++)
{
f >> a[i][j];
}
}
for (int i = 0;i < N;i++)
{
int s = 0;
for (int j = 0;j < M;j++)
{
s += a[i][j];
}
if (s < minl) minl = s;
}
for (int i = 0;i < M;i++)
{
int s2 = 0;
for (int j = 0;j < N;j++)
{
s2 += a[j][i];
}
if (s2 < minc) minc = s2;
}
for(int i = 0;i < N;i++)
{
for (int j = 0;j < M;j++)
{
smax += a[i][j];
}
}
sfinal = smax + 2 * (-minl) + 2 * (-minc);
g << sfinal;
}