Pagini recente » Cod sursa (job #649849) | Cod sursa (job #1762271) | ONIS 2014, Clasament Final | Cod sursa (job #897466) | Cod sursa (job #113556)
Cod sursa(job #113556)
#include<fstream.h>
ifstream f("flip.in");
ofstream g("flip.out");
long int a[17][17],c[17],l[17],s1,s2,s;
int n,m;
int main()
{
int i,j;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>a[i][j];
l[i]=l[i]+a[i][j];
c[j]=c[j]+a[i][j];
}
for(i=1;i<=n;i++)
{
if(l[i]<0) l[i]=-l[i];
s1+=l[i];
for(j=1;j<=m;j++)
a[i][j]=-a[i][j];
}
for(j=1;j<=m;j++)
{
if(c[j]<0) c[j]=-c[j];
s1+=c[j];
for(i=1;i<=n;i++)
a[i][j]=-a[i][j];
}
for(j=1;j<=m;j++)
{
if(c[j]<0) c[j]=-c[j];
s2+=c[j];
for(i=1;i<=n;i++)
a[i][j]=-a[i][j];
}
for(i=1;i<=n;i++)
{
if(l[i]<0) l[i]=-l[i];
s2+=l[i];
for(j=1;j<=m;j++)
a[i][j]=-a[i][j];
}
if(s1>s2) g<<s1<<" ";
else g<<s2<<" ";
/* for(i=1;i<=n;i++)
g<<l[i]<<" ";
g<<"\n";
for(j=1;j<=m;j++)
g<<c[j]<<" ";
*/
f.close();
g.close();
}