Pagini recente » Cod sursa (job #424770) | Cod sursa (job #572945) | Cod sursa (job #532472) | Cod sursa (job #3136236) | Cod sursa (job #2018762)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long n,m,a[17][17],s[17],p[17],k;
int main()
{int i,j;
f>>n>>m;
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
{f>>a[i][j]; s[i]=s[i]+a[i][j];}
if(s[i]<0)
for(j=1;j<=m;j++) a[i][j]=-a[i][j];}
for(j=1;j<=m;j++)
{for(i=1;i<=n;i++)
p[j]=p[j]+a[i][j];
if(p[j]<0)
for(i=1;i<=n;i++) a[i][j]=-a[i][j];
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++) k=k+a[i][j];
g<<k;
return 0;
}