Cod sursa(job #2213311)
| Utilizator | Data | 16 iunie 2018 10:32:32 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 1.47 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream f("flip.in");
ofstream g("flip.out");
int k,s,n,m,a[16][16],i,j,sumaPozitiva,sumaNegativa;
f >>n;
f >>m;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
f>>a[i][j];
}
}
for(j=1;j<=m;j++){
sumaPozitiva=0;
sumaNegativa=0;
for(k=1;k<=n;k++){
if(a[k][j]>0)
sumaPozitiva += a[k][j];
else
sumaNegativa -= a[k][j];
}
if(sumaNegativa>sumaPozitiva){
for(k=1;k<=n;k++){
a[k][j] = a[k][j] * -1;
}
}
}
for(i=1;i<=n;i++){
sumaPozitiva=0;
sumaNegativa=0;
for(k=1;k<=m;k++){
if(a[i][k]>0)
sumaPozitiva += a[i][k];
else
sumaNegativa -= a[i][k];
}
if(sumaNegativa>sumaPozitiva){
for(k=1;k<=n;k++){
a[i][k] = a[i][k] * -1;
}
}
}
s=0;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
s+=a[i][j];
}
}
g << s;
f.close();
g.close();
return 0;
}
