Pagini recente » Statistici Lennor Docdoc (lennor0921) | Monitorul de evaluare | Statistici Licaret Raul (Licaret_Raul) | Arhiva de probleme | Cod sursa (job #530166)
Cod sursa(job #530166)
#include <iostream>
#include <fstream>
using namespace std;
int n,m;
int main ()
{
int i,j,a[20][20],suma,k;
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];
for(j=1;j<=m;j++)
{
suma=0;
for(i=1;i<=n;i++)
suma+=a[j][i];
if(suma<0)
{for(k=1;k<=n;k++)
a[j][k]*=-1;
}
}
for(j=1;j<=n;j++)
{
suma=0;
for(i=1;i<=m;i++)
suma+=a[j][i];
if(suma<0)
{for(k=1;k<=n;k++)
a[j][k]*=-1;
}
}
suma=0;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
suma+=a[i][j];
g<<suma;
f.close();
g.close();
return 0;
}