Pagini recente » Borderou de evaluare (job #1274411) | Borderou de evaluare (job #2016934) | Borderou de evaluare (job #1439172) | Borderou de evaluare (job #609939) | Cod sursa (job #1066380)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("flip.in");
ofstream fout("flip.out");
int m, n, sum = 0, sum2 = 0;
fin>>m>>n;
int arr[m][n];
for(int i=0; i< m; i++)
{
sum = 0 ;
for(int j=0; j< n; j++)
{
fin>>arr[i][j];
sum+= arr[i][j];
}
if(sum < 0)
{
for(int j=0; j< n; j++)
{
arr[i][j]*=-1;
}
}
}
for(int i=0; i< n; i++)
{
sum = 0;
for(int j=0; j< m; j++)
{
sum += arr[j][i];
}
if(sum < 0)
{
sum2-=sum;
}
else sum2 += sum;
}
fout<<sum2<<endl;
return 0;
}