Pagini recente » Cod sursa (job #2214848) | Statistici Alexandru Fazakas (AlexFazakas) | Cod sursa (job #2261696) | Statistici Maghear Ovidiu (ovidiu.maghear) | Cod sursa (job #1525898)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int a[20][20],n,m,smax;
int suma(int x,int y)
{
int s=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(x==i||y==j)
s+=a[i][j]*-1;
else
s+=a[i][j];
return s;
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>a[i][j];
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
{
int ss;
ss=suma(i,j);
if(ss>smax)
smax=ss;
}
g<<smax;
return 0;
}