Pagini recente » Cod sursa (job #1780323) | Borderou de evaluare (job #2106585) | Cod sursa (job #2475763) | Cod sursa (job #2034223) | Cod sursa (job #2772585)
#include <fstream>
using namespace std;
ifstream fin("flip.in");
ofstream fout("flip.out");
int main()
{
int n,m,a[17][17],S=0,s=0;
fin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
fin>>a[i][j];
}
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(a[i][j]<0)
{
s=s+a[i][j];
a[i][j]=a[i][j]*(-1);
}
S=S+a[i][j];
}
}
S=S+s;
fout<<S;
return 0;
}