Pagini recente » Cod sursa (job #238638) | Cod sursa (job #2025602) | Cod sursa (job #834681) | Cod sursa (job #994963) | Cod sursa (job #1683828)
#include <iostream>
#include <fstream>
#include <math.h>
#include <stdlib.h>
using namespace std;
ifstream f ("flip.in");
ofstream g ("flip.out");
int main()
{int n, m, i, j, maxl=0, maxc=0, s;
long a[16][16];
f>>n;
f>>m;
for (i=1; i<=n; i++)
for (j=1; j<=m; j++)
f>>a[i][j];
for(i=1; i<=n; i++)
{
s=0;
for (j=1; j<=m; j++)
s=s+ (-1*a[i][j]);
a[i][m+1]=s;
}
for (j=1; j<=m; j++)
{
s=0;
for (i=1; i<=n; i++)
s=s+(-1*a[i][j]);
a[n+1][j]=s;
}
for (i=1; i<=n; i++)
if (a[i][m+1]>maxl) maxl=a[i][m+1];
for (j=1; j<=m; j++)
if (a[n+1][j]>maxc) maxc=a[n+1][j];
g<<maxl+maxc;
f.close();
g.close ();
return 0;
}