Pagini recente » Cod sursa (job #1852996) | Cod sursa (job #1939347) | Istoria paginii runda/preoji.bdc.19/clasament | Cod sursa (job #2053423) | Cod sursa (job #497303)
Cod sursa(job #497303)
#include <fstream>
using namespace std;
fstream fin("flip.in");
fstream fout("flip.out");
int main()
{
int n,m;
int s = 0;
fin >> n >> m;
int ** mtx = (int**)malloc( n * sizeof( int * ) );
for( int i = 0; i < n; i++ )
mtx[i] = (int*)malloc( m * sizeof( int ) );
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
fin >> mtx[i][j];
fin.close();
for(int i = 0; i<n ;i++)
{
int sum1 = 0;
int sum2 = 0;
for(int j = 0; j < m;j++)
{
sum1 += mtx[i][j];
sum2 -= mtx[i][j];
}
if(sum2 > sum1)
{
for(int k = 0; k < m;k++)
mtx[i][k] = -1*mtx[i][k];
}
}
for(int i = 0; i<m ;i++)
{
int sum1 = 0;
int sum2 = 0;
for(int j = 0; j < n;j++)
{
sum1 += mtx[j][i];
sum2 -= mtx[j][i];
}
if(sum2 > sum1)
{
for(int k = 0; k < n;k++)
mtx[k][i] = -1*mtx[k][i];
}
}
for(int i = 0; i < n; i++)
for(int j = 0; j < m; j++)
s += mtx[i][j];
fout << s;
fout.close();
free(mtx);
return 0;
}