Pagini recente » Cod sursa (job #2323483) | Cod sursa (job #678106) | Monitorul de evaluare | Cod sursa (job #1039436) | Cod sursa (job #1038836)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long int suma_c(int n,long int a[][16],int k)
{long int suma=0;
for(int i=0;i<n;i++)
suma+=a[i][k];
return suma;
}
long int suma_l(int m,long int a[][16],int k)
{long int suma=0;
for(int i=0;i<m;i++)
suma+=a[k][i];
return suma;
}
void semn_l(int m,long int a[][16],int k)
{ for(int i=0;i<m;i++)
a[k][i]=-a[k][i];
}
void semn_c(int n,long int a[][16],int k)
{
for(int i=0;i<n;i++)
a[i][k]=-a[i][k];
}
int main()
{unsigned int n,m;long int s=0,a[16][16];
f>>n>>m;
for(unsigned int i=0;i<n;i++)
for(unsigned int j=0;j<m;j++)
f>>a[i][j];
for(unsigned int i=0;i<n;i++)
for(unsigned int j=0;j<m;j++)
if(-suma_c(n,a,j)>suma_c(n,a,j) || -suma_l(m,a,i)>suma_l(m,a,i))
{if((-suma_c(n,a,j)-suma_c(n,a,j))>=(-suma_l(m,a,i)-suma_l(m,a,i)))
semn_c(n,a,j);
else
semn_l(n,a,i);
i=0;j=0;}
for(unsigned int i=0;i<n;i++)
s+=suma_l(m,a,i);
g<<s;
return 0;
}