Cod sursa(job #1293223)
| Utilizator | Data | 15 decembrie 2014 16:33:32 | |
|---|---|---|---|
| Problema | Jocul Flip | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<fstream>
#include<limits>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{ int flip[100][100],m,n,i,j,s=0,sn=0;
f>>m>>n;
//citim matricea
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
f>>flip[i][j];
//pt ca suma sa fie maxima trebuie sa adunam doar elementele pozitive
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
if (flip[i][j]>=0) s=s+flip[i][j];
else sn=sn+flip[i][j];
}
if(s>=(-sn)) g<<s;
else g<<s,n;
}
