title: Integer Positive Value Positive Negative Value Array 1
signature: function integerPositiveValuePositiveNegativeValueArray1($arr, $n) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return abs($actual - $expected) < 1e-09;
  }
  
  function driver($arr, $n, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($arr, $n), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        array(49, 98), 1, 
        49.0));
      
      printf("TEST-1...%s\n",driver(
        array(82, 66, -68, 24, -10), 2, 
        74.0));
      
      printf("TEST-2...%s\n",driver(
        array(0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1), 8, 
        0.125));
      
      printf("TEST-3...%s\n",driver(
        array(56, 3, 18, 5, 20, 56, 47, 29, 60, 98, 60, 40, 42, 2, 54, 56, 91, 8, 93, 14, 31, 27, 61, 49, 23, 12, 71), 25, 
        41.72));
      
      printf("TEST-4...%s\n",driver(
        array(-94, -94, -92, -86, -50, -48, -6, 8, 28, 40, 44, 58, 62, 72, 94), 12, 
        -146.0));
      
      printf("TEST-5...%s\n",driver(
        array(0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1), 36, 
        0.5833333333333334));
      
      printf("TEST-6...%s\n",driver(
        array(16, 56, 56), 1, 
        16.0));
      
      printf("TEST-7...%s\n",driver(
        array(74, -90, -92, 30, -18, 66, -66, 22), 5, 
        -96.0));
      
      printf("TEST-8...%s\n",driver(
        array(0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), 7, 
        0.5714285714285714));
      
      printf("TEST-9...%s\n",driver(
        array(21, 64, 82, 78, 30, 34, 35), 5, 
        55.0));
      
  }
  
  main();
  ?>
source_py: def integer_positive_value_positive_negative_value_array_1(arr, n):
      neg = 0
      pos = 0
      sum = 0
      for i in range(0, n):
          sum += arr[i]
          if (arr[i] < 0):
              neg += 1
          else:
              pos += 1
      return (sum / abs((neg - pos)))
source_cpp: int integer_positive_value_positive_negative_value_array_1(vector<int> arr, int n) {
    int neg = 0, pos = 0;
    int sum = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      sum += arr [ i ];
      if ( arr [ i ] < 0 ) neg ++;
      else pos ++;
    }
    return ( sum / abs ( neg - pos ) );
  }