Pagini recente » Cod sursa (job #1051070) | Cod sursa (job #269622) | Cod sursa (job #2806717) | Cod sursa (job #725363) | Cod sursa (job #294311)
Cod sursa(job #294311)
#include<fstream.h>
main()
{
ifstream in("flip.in");
ofstream o("flip.out");
int m,n,i,j;
long a[20][20], s1, k=0;
in>>n>>m;
for(i=1;i<=n;i++)
{ for(j=1,s1=0;j<=m;j++)
{ in>>a[i][j];
s1+=a[i][j];
}
if(s1<0)
for(j=1;j<=m;j++)
a[i][j]=0-a[i][j];
}
while(k==0)
{
k=1;
for(j=1;j<=m;j++)
{ for(i=1,s1=0;i<=n;i++)
s1+=a[i][j];
if(s1<0)
{ for(i=1;i<=n;i++)
a[i][j]=0-a[i][j];
if(k==1)
k=0;
}
}
for(i=1;i<=n;i++)
{ for(j=1,s1=0;j<=m;j++)
s1+=a[i][j];
if(s1<0)
{ for(i=1;i<=n;i++)
a[i][j]=0-a[i][j];
if(k==0)
k=1;
}
}
}
for(i=1,s1=0;i<=n;i++)
for(j=1;j<=m;j++)
s1+=a[i][j];
o<<s1;
in.close();
o.close();
return 0;
}