Pagini recente » Statistici Le Minh Hoang (Monarchuwu) | Cod sursa (job #456647) | Cod sursa (job #1863834) | Cod sursa (job #2312877) | Cod sursa (job #2190120)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,j,s1,s2,n, m, a[16][16],k;
long long s;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for (i=1;i<=n;i++)
{s1=0;s2=0;
for(j=1;j<=m;j++)
{
s1=s1+a[i][j];
s2=s2-a[i][j];
}
if (s2>s1)
for (k=1;k<=m;k++)
a[i][k]=-a[i][k];
}
for (i=1;i<=m;i++)
{s1=s2=0;
for(j=1;j<=n;j++)
{s1=s1+a[j][i];
s2=s2-a[j][i];}
if (s2>s1)
for (k=1;k<=n;k++)
a[k][i]=-a[k][i];
}
for (i=1;i<=m;i++)
for (j=1;j<=n;j++)
s=s+a[i][j];
g<<s;
f.close();
g.close();
return 0;
}