Pagini recente » Cod sursa (job #561023) | Cod sursa (job #399718) | Cod sursa (job #2382635) | Cod sursa (job #1203794) | Cod sursa (job #1129201)
using namespace std;
#include<fstream>
#include<iostream>
int a[99999999][99999999],n,m;
int main()
{
int i,j,s=0,ok,k=0;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
f>>a[i][j];
a[i][0]+=a[i][j];
a[0][j]+=a[i][j];
}
}
do
{
ok=1;
for(i=1;i<=n;i++)
if(a[i][0]<0)
{
a[i][0]*=-1;
for(j=1;j<=m;j++)
{
a[0][j]+=2*(a[i][j]*-1);
a[i][j]*=-1;
}
ok=0;
}
for(i=1;i<=m;i++)
if(a[0][i]<0)
{
a[0][i]*=-1;
for(j=1;j<=n;j++)
{
a[j][0]+=2*(a[j][i]*-1);
}
ok=0;
}
}
while (ok==0);
for(i=1;i<=m;i++)
s+=a[0][i];
g<<s;
f.close();
g.close();
return 0;
}