Pagini recente » Cod sursa (job #2566893) | Cod sursa (job #2629607) | Cod sursa (job #655424) | Cod sursa (job #538328) | Cod sursa (job #2409867)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
void C(int n,int m, int v[17][17])
{
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
f>>v[i][j];
}
void Citire(int n,int m, int v[17][17])
{
int s1=0,s2=0;
for(int i=1;i<=n;i++)
{
s1=0; s2=0;
for(int j=1;j<=m;j++)
{
s1+=v[i][j];
s2+=-v[i][j];
}
if(s2>s1)
for(int j=1;j<=m;j++)
v[i][j]=-v[i][j];
}
}
void Citire2(int n, int m, int v[17][17])
{
int s1,s2;
for(int j=1;j<=m;j++)
{
s1=0; s2=0;
for(int i=1;i<=n;i++)
{
s1+=v[i][j];
s2+=-v[i][j];
}
if(s2>s1)
for(int i=1;i<=n;i++)
v[i][j]=-v[i][j];
}
}
int Suma(int n, int m, int v[17][17])
{
int s=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
s+=v[i][j];
return s;
}
int main()
{int n,m,v[17][17];
f>>n>>m;
C(n,m,v);
Citire(n,m,v);
Citire2(n,m,v);
int s=Suma(n,m,v);
Citire2(n,m,v);
Citire(n,m,v);
if(Suma(n,m,v)>s)
g<<Suma(n,m,v);
else
g<<s;
return 0;
}