Pagini recente » Cod sursa (job #1680706) | Istoria paginii utilizator/round2 | Cod sursa (job #1726618) | Cod sursa (job #1975586) | Cod sursa (job #2677104)
#include<fstream>
using namespace std;
int d[20][20],N,M,i,j,S;
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{
f>>N>>M;
for(i=1; i<=N; ++i)
for(j=1; j<=M; ++j)
f >> d[i][j];
for(j=1; j<=M; ++j)
{
S=0;
for(i=1; i<=N; ++i)
S=S+d[i][j];
if(S<0)
{
for(i=0; i<=N; ++i)
d[i][j]=d[i][j]*(-1);
}
}
for(i=1; i<=N; ++i)
{
S=0;
for(j=1; j<=M; ++j)
S=S+d[i][j];
if(S<0)
{
for(j=1; j<=M; ++j)
d[i][j]=d[i][j]*(-1);
}
}
S=0;
for(i=1; i<=N; ++i)
for(j=1; j<=M; ++j)
S=S+d[i][j];
g << S;
return 0;
}