Pagini recente » Cod sursa (job #1554663) | Cod sursa (job #1115477) | Cod sursa (job #2202609) | Cod sursa (job #614019) | Cod sursa (job #902875)
Cod sursa(job #902875)
#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("flip.in");
ofstream ki("flip.out");
long long n,m,a[17][17],s,ss;
bool gasit;
int main()
{
ka>>n>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
ka>>a[i][j];
do
{
gasit=false;
for(int i=1;i<=n;i++)
{
s=0;ss=0;
for(int j=1;j<=m;j++)
{
if(a[i][j]>0)
s+=a[i][j];
else
ss+=-a[i][j];
}
if(ss>s)
{
gasit=true;
for(int j=1;j<=m;j++)
{
a[i][j]=-a[i][j];
}
}
}
for(int j=1;j<=m;j++)
{
s=0;ss=0;
for(int i=1;i<=n;i++)
{
if(a[i][j]>0)
s+=a[i][j];
else
ss+=-a[i][j];
}
if(ss>s)
{
gasit=true;
for(int i=1;i<=n;i++)
{
a[i][j]=-a[i][j];
}
}
}
}while(gasit);
s=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
s+=a[i][j];
ki<<s;
}