Pagini recente » Cod sursa (job #1008372) | Cod sursa (job #1171498) | Istoria paginii runda/13 | Cod sursa (job #2029881) | Cod sursa (job #1799494)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{short n,m,i,j,z;
int a[20][20],S=0;
f>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
f>>a[i][j];
i=1;
z=1;
while(i<=n)
for(j=1; j<=m; j++)
{
if(j<=m)
{
S=S+a[i][j];
}
if(j==m)
{
if(S<0)
for(z=1;z<=m;z++)
a[i][z]=-a[i][z];
S=0;
i++;
}
}
j=1;
while(j<=m)
for(i=1; i<=n; i++)
{
if(i<=n)
{
S=S+a[i][j];
}
if(i==n)
{
if(S<0)
for(z=1;z<=n;z++)
a[z][j]=-a[z][j];
S=0;
j++;
}
}
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
S=S+a[i][j];
g<<S;
return 0;
}