Pagini recente » Cod sursa (job #1682379) | Cod sursa (job #102744) | Cod sursa (job #2287170) | Cod sursa (job #552676) | Cod sursa (job #256844)
Cod sursa(job #256844)
#include<fstream.h>
int main()
{
int n,m,i,j;
long a[18][18],s,p=0,ok;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
{
s=0;
for(j=1;j<=m;j++)
{
f>>a[i][j];
s=s+a[i][j];
}
a[i][0]=s;
}
for(j=1;j<=m;j++)
{
s=0;
for(i=1;i<=n;i++)
s=s+a[i][j];
a[0][j]=s;
}
do{ ok=0;
for(i=1;i<=n;i++)
if(a[i][0]<0)
{ ok=1;
a[i][0]=-a[i][0];
for(j=1;j<=m;j++)
{
a[0][j]=a[0][j]-2*a[i][j];
a[i][j]=-a[i][j];
}
}
for(j=1;j<=m;j++)
if(a[0][j]<0)
{ok=1;
a[0][j]=-a[0][j];
for(i=1;i<=n;i++)
{
a[i][0]=a[i][0]-2*a[i][j];
a[i][j]=-a[i][j];
}
}
}while(ok==1);
for(i=1;i<=n;i++)
p=p+a[i][0];
g<<p;
f.close();
g.close();
return 0;
}