Pagini recente » Cod sursa (job #796888) | Cod sursa (job #2708495) | Cod sursa (job #61003) | Cod sursa (job #1272383) | Cod sursa (job #1905536)
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,a[16][16];
f>>n>>m;
long long spoz=0,sneg=0,sfin=0,spoz2=0,sneg2=0;
for (int i=1;i<=n;++i)
{
sneg=0;spoz=0;
for (int j=1;j<=m;j++)
{
f>>a[i][j];
if (a[i][j]>=0) spoz+=a[i][j];
else sneg+=a[i][j];
}
if (spoz<-sneg)
{
for (int j=1;j<=m;j++)
{
a[i][j]=a[i][j]*(-1);
}
}
}
for (int j=1;j<=m;j++)
{
spoz2=0;sneg2=0;
for (int i=1;i<=n;++i) {
if (a[i][j]>=0) spoz2+=a[i][j];
else sneg2+=a[i][j];
}
if (spoz2<-sneg2)
{
for (int i=1;i<=n;++i)
{
a[i][j]=a[i][j]*(-1);
}
}
}
for (int i=1;i<=n;++i)
{
for (int j=1;j<=m;j++)
{
sfin+=a[i][j];
}
}
g<<sfin;
return 0;
}