Pagini recente » Cod sursa (job #333418) | Cod sursa (job #374069) | Cod sursa (job #136650) | Cod sursa (job #1138082) | Cod sursa (job #1184345)
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,k,i,j;
long s=0,a[10][10],b[10][10],s1,s2;
f>>n;
f>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>a[i][j];
b[i][j]=a[i][j];
}
for(i=1;i<=n;i++)
{
s2=0;
s1=0;
for(j=1;j<=m;j++)
{
s1+=a[i][j];
s2-=a[i][j];
}
if(s2>s1)
for(k=1;k<=m;k++)
a[i][k]=-a[i][k];
}
for(j=1;j<=m;j++)
{
if(a[1][j]==b[1][j])
{
s2=0;
s1=0;
for(i=1;i<=n;i++)
{
s1+=a[i][j];
s2-=a[i][j];
}
if(s2>s1)
for(k=1;k<=n;k++)
s-=a[k][j];
else
for(k=1;k<=n;k++)
s+=a[k][j];
}
else
for(i=1;i<=n;i++)
s+=a[i][j];
}
g<<s;
f.close();
g.close();
return 0;
}