Pagini recente » Cod sursa (job #1504076) | Cod sursa (job #1575321) | Cod sursa (job #150176) | Istoria paginii utilizator/dinuionica2001 | Cod sursa (job #2683732)
#include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream in("flip.in");
ofstream out("flip.out");
int c,r;
int long long sum = 0;
in >> r >>c;
int m[r][c];
for(int i =1; i<=r;i++)
for(int h=1;h<=c;h++)
in >> m[i][h];
for(int i =1; i<=r;i++)
for(int h=1;h<=c;h++)
if(m[i][h] >=0)
sum += m[i][h];
out << sum;
return 0;
}