Pagini recente » Cod sursa (job #2650226) | Cod sursa (job #920739) | Cod sursa (job #1282710) | Cod sursa (job #2691654) | Cod sursa (job #1779012)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,j,n,m,p,k;
long max1,min1,a[120][120],s=0;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
{
max1=-1000034;
min1=1000034;
for(j=1;j<=m;j++)
{
if(max1<a[i][j])
max1=a[i][j];
if(min1>a[i][j])
min1=a[i][j];
}
if(abs(min1)>max1)
{
for(k=1;k<=m;k++)
a[i][k]=-1*a[i][k];
}
}
for(i=1;i<=m;i++)
{
max1=-1034;
min1=1034;
for(j=1;j<=n;j++)
{
if(max1<a[j][i])
max1=a[j][i];
if(min1>a[j][i])
min1=a[j][i];
}
if(abs(min1)>max1)
{
for(k=1;k<=n;k++)
a[k][i]=-1*a[k][i];
}
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+a[i][j];
g<<s;
}