Pagini recente » Cod sursa (job #2700695) | Cod sursa (job #2319497) | Cod sursa (job #78627) | Cod sursa (job #2340812) | Cod sursa (job #846292)
Cod sursa(job #846292)
#include<fstream>
using namespace std;
int main()
{ ifstream f("flip.in");
ofstream g("flip.out");
long A[17][17],Suma=0;
int N, M, i, j, k, s1=0, s2=0, B[17][17];
f>>N>>M;
for(i=0;i<N;i++)
{ for(j=0;j<M;j++)
{
f>>A[i][j];
B[i][j]=0;
if(A[i][j]<0)s1 = s1 - A[i][j];
else s2 = s2 + A[i][j];
}
if(s1>s2)for(k=0;k<M;k++)B[i][k]=1;
s1=s2=0;
}
for(j=0;j<M;j++)
{
for(i=0;i<N;i++)
{
if(A[i][j]<0)s1 = s1 - A[i][j];
else s2 = s2 + A[i][j];
}
if(s1>s2)for(k=0;k<N;k++)B[k][j]=1;
s1=s2=0;
}
for(i=0;i<N;i++)
{ for(j=0;j<M;j++)
{ if(B[i][j]==1)A[i][j]*=(-1);
Suma += A[i][j];
}
}
g<<Suma;
f.close();
g.close();
return 0;
}