Pagini recente » Cod sursa (job #1461223) | Cod sursa (job #309109) | Cod sursa (job #2208323) | Cod sursa (job #440105) | Cod sursa (job #2232734)
#include <fstream>
using namespace std;
int main()
{
ifstream fin("flip.in");
ofstream fout("flip.out");
int N, M, i, j, sum1=0,psum, sum2=0;
fin >> N >> M;
int v[N][M];
for(i=1;i<=N;++i)
{
for (j=1;j<=M;++j)
fin >> v[i][j];
}
i=1;
while(i<=N){
psum=0;
for(j=1;j<=M;++j)
{
psum=psum+v[i][j];
}
if(psum<psum*(-1))
{for(j=1;j<=N;++j)
v[i][j]=v[i][j]*(-1);
}
++i;}
while(j<=M){
psum=0;
for(i=1;i<=N;++i)
{
psum=psum+v[i][j];
}
if(psum<psum*(-1))
{for(i=1;i<=N;++i)
v[i][j]=v[i][j]*(-1);
}
++j;}
for(i=1;i<=N;++i)
{
for(j=1;j<=M;++j)
sum1=sum1+v[i][j];
}
while(j<=M){
psum=0;
for(i=1;i<=N;++i)
{
psum=psum+v[i][j];
}
if(psum<psum*(-1))
{for(i=1;i<=N;++i)
v[i][j]=v[i][j]*(-1);
}
++j;}
while(i<=N){
psum=0;
for(j=1;j<=M;++j)
{
psum=psum+v[i][j];
}
if(psum<psum*(-1))
{for(j=1;j<=N;++j)
v[i][j]=v[i][j]*(-1);
}
++i;
for(i=1;i<=N;++i)
{
for(j=1;j<=M;++j)
sum2=sum2+v[i][j];
}}
if(sum2>sum1)
fout << sum2;
else
fout << sum1;
return 0;
}