Cod sursa(job #2324282)
Utilizator | Data | 20 ianuarie 2019 15:28:31 | |
---|---|---|---|
Problema | Factorial | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.32 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,i,j,v[256][256],S=0;
f>>n>>m;
for(i = 1; i<=n; i++)
for(j = 1; j<=m; j++)
f>>v[i][j];
for(i = 1; i<=n; i++)
for(j = 1; j<=m; j++)
if(v[i][j]>=0)
S+=v[i][j];
g<<S;
return 0;
}