Pagini recente » Cod sursa (job #748606) | Borderou de evaluare (job #1122783) | Borderou de evaluare (job #2227097) | Cod sursa (job #2930900) | Cod sursa (job #3249156)
#include <bits/stdc++.h>
using namespace std;
ifstream in("flip.in");
ofstream out("flip.out");
int n,m,x[17][17],linp,sum,k[17][17];
int main()
{
in>>n>>m;
for(int i=1;i<=n;i++)
{
linp=0;
for(int j=1;j<=m;j++)
{
in>>x[i][j];
linp+=x[i][j];
}
if(linp<0)
for(int j=1;j<=m;j++)
k[i][j]=x[i][j]*-1;
else
for(int j=1;j<=m;j++)
k[i][j]=x[i][j];
}
for(int j=1;j<=m;j++)
{
linp=0;
for(int i=1;i<=n;i++)
linp+=k[i][j];
if(linp<0)
for(int i=1;i<=n;i++)
k[i][j]=k[i][j]*-1;
else
for(int i=1;i<=n;i++)
k[i][j]=k[i][j];
}
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
sum+=k[i][j];
out<<sum<<'\n';
return 0;
}