Pagini recente » Cod sursa (job #1012341) | Cod sursa (job #1252081) | Cod sursa (job #634347) | Cod sursa (job #2627726) | Cod sursa (job #1839904)
#include <fstream>
using namespace std;
long long int m,n,i,j,v[17][17],s1=0,s2=0,s,a[17][17],s3,l;
int main()
{
ifstream fin("filip.in");
ofstream fout("filip.out");
fin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
fin>>v[i][j];
a[i][j]=v[i][j];
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
s1=0;
s2=0;
{
s1=s1+v[i][j];
s2=s1-v[i][j];
}
if(s1<s2)
for(l=1;l<=m;l++)
{
v[i][l]=-v[i][l];
}
}
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
{
s1=0;
s2=0;
{
s1=s1+v[i][j];
s2=s1-v[i][j];
}
if(s1<s2)
for(l=1;l<=n;l++)
{
v[l][j]=-v[l][j];
}
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+v[i][j];
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
{
s1=0;
s2=0;
{
s1=s1+v[i][j];
s2=s1-v[i][j];
}
if(s1<s2)
for(l=1;l<=n;l++)
{
v[l][j]=-v[l][j];
}
}
for(j=1;j<=m;j++)
for(i=1;i<=n;i++)
{
s1=0;
s2=0;
{
s1=s1+v[i][j];
s2=s1-v[i][j];
}
if(s1<s2)
for(l=1;l<=m;l++)
{
v[i][l]=-v[i][l];
}
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s3=s3+v[i][j];
if(s>=s3)
fout<<s;
else fout<<s3;
fin.close();
fout.close();
return 0;
}