Pagini recente » Cod sursa (job #557176) | Cod sursa (job #192830) | Cod sursa (job #1601334) | Cod sursa (job #2642332) | Cod sursa (job #2642334)
#include <iostream>
#include <fstream>
using namespace std;
int n,m,i,j ;
long long v[16][16] ,S ;
int main()
{
ifstream in("flip.in");
ofstream out("flip.out");
in >> n >> m ;
for(i=0;i<=n-1;i++)
{
for(j=0;j<=m-1;j++)
{
in >> v[i][j];
}
}
i=0 ;
while(i!=n)
{
S=0;
for(j=0;j<=m-1;j++)
S=S+v[i][j];
if(S<0)
for(j=0;j<=m-1;j++)
v[i][j]=-v[i][j];
i++;
}
j=0 ;
while(j!=m)
{
S=0;
for(i=0;i<=n-1;i++)
S=S+v[i][j];
if(S<0)
for(i=0;i<=n-1;i++)
v[i][j]=-v[i][j];
j++;
}
S=0;
for(i=0;i<=n-1;i++)
{
for(j=0;j<=m-1;j++)
{
S=S+v[i][j];
}
}
out << S;
in.close();
out.close();
return 0;
}