Pagini recente » Cod sursa (job #1962470) | Cod sursa (job #1644963) | Cod sursa (job #50814) | Cod sursa (job #111168) | Cod sursa (job #2348638)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("flip.in");
ofstream fo("flip.out");
int main()
{
int n , m,v[17][17];
fi>>n>>m;
int i, j;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
fi>>v[i][j];
int conp,conne,s,S=0;
for(j=1;j<=m;j++)
{
conp=0;
conne=0;
s=0;
for(i=1;i<=n;i++)
{
s=s+v[i][j];
if(v[i][j]<0)
{
conne++;
}else if(v[i][j]>0)
{
conp++;
}
}
if(conp<=conne&&s<=0)
{
for(i=1;i<=n;i++)
v[i][j]=-v[i][j];
}
}
for(i=1;i<=n;i++)
{
conp=0;
conne=0;
s=0;
for(j=1;j<=m;j++)
{
if(v[i][j]>0)
{
conp++;
}else if(v[i][j]<0)
{
conne++;
}
s=s+v[i][j];
}
if(conne>=conp&&s<=0)
{
for(j=1;j<=m;j++)
{
v[i][j]=-v[i][j];
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
S=S+v[i][j];
}
}
fo<<S;
fi.close();
fo.close();
return 0;
}