Pagini recente » Cod sursa (job #3001758) | Cod sursa (job #2554997) | Cod sursa (job #1592075) | Cod sursa (job #3180376) | Cod sursa (job #2551163)
#include <iostream>
#include<fstream>
using namespace std;
int main()
{
int a[101][101],m,n,i,j,k,s=0;
ifstream f("flip.in");
ofstream g("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
int p,q;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
p=0;q=0;k=1;
if(a[i][j]<0) p=p+a[i][j];
if(a[i][j]>=0) q=q+a[i][j];
}
if(p>q)
while(k<=m)
{
a[i][k]=a[i][k]*-1;
k++;
}
}
for(j=1;j<=m;j++)
{
for(i=1;i<=n;i++)
{
p=0;q=0;k=1;
if(a[i][j]<0) p=p+a[i][j];
if(a[i][j]>=0) q=q+a[i][j];
}
if(p>q)
while(k<=n)
{
a[k][j]=a[k][j]*-1;
k++;
}
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+a[i][j];
g<<s;
f.close();
g.close();
}