// GOTO-free
int positiveSum(int V[], int size) {
  int sum = 0 ;
  for (int i=0; i<size; ++i) {
    if (V[i] >= 0) {
      sum = sum + V[i] ;
     } else {
       V[i] = 0 ;
     }
    }
  return sum ;
}


// GOTO-full
int positiveSum(int V[], int size) {
     int sum = 0 ;
     int i = 0 ;
     goto loopTest ;  
  loopStart:
     if (V[i] < 0) goto negativeVi ;
     sum = sum + V[i] ;
     goto joinVi ;
  negativeVi:   
     V[i] = 0 ;
  joinVi:
     ++i ;
  loopTest:
     if (i<size) goto loopStart ;
     return sum ;
}