Pagini recente » tema | Cod sursa (job #440365) | tema | Istoria paginii runda/temadivizori9_17_10 | Cod sursa (job #557273)
Cod sursa(job #557273)
#include<fstream>
using namespace std;
int main (void)
{
ifstream f("flip.in");
ofstream g("flip.out");
long int i,j,m,n,s1,s2;
double a[100][100];
f>>n;
f>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
if(n>=m)
{
for(i=1;i<=n;i++)
{
s1=0;
s2=0;
for(j=1;j<=m;j++)
if(a[i][j]>=0)
s1+=a[i][j];
else
s2+=a[i][j];
if(-1*s2>s1)
for(j=1;j<=m;j++)
a[i][j]=-1*a[i][j];
}
for(j=1;j<=m;j++)
{
s1=0;
s2=0;
for(i=1;i<=n;i++)
if(a[i][j]>=0)
s1+=a[i][j];
else
s2+=a[i][j];
if(-1*s2>s1)
for(i=1;i<=n;i++)
a[i][j]=-1*a[i][j];
}
}
else
{
for(i=1;i<=n;i++)
{
s1=0;
s2=0;
for(j=1;j<=m;j++)
if(a[i][j]>=0)
s1+=a[i][j];
else
s2+=a[i][j];
if(-1*s2>s1)
for(j=1;j<=m;j++)
a[i][j]=-1*a[i][j];
}
for(j=1;j<=m;j++)
{
s1=0;
s2=0;
for(i=1;i<=n;i++)
if(a[i][j]>=0)
s1+=a[i][j];
else
s2+=a[i][j];
if(-1*s2>s1)
for(i=1;i<=n;i++)
a[i][j]=-1*a[i][j];
}
}
s1=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s1+=a[i][j];
g<<s1;
f.close();
g.close();
}