title: Count Pairs Two Sorted Arrays Whose Sum Equal Given Value X
signature: function count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x(arr1, arr2, m, n, x)
test_code: 
  
  -- SOLUTION CODE
  -- ============================================
  PLACEHOLDER_CODE_BODY
  
  -- TESTING CODE 
  -- ============================================
  function isCorrect(actual, expected)
      if type(expected) ~= type(actual) then
          return false
      end
      
      if type(expected) == 'table' then
          for k,v_expected in pairs(expected) do
              
              if actual[k] == nil then
                  return false
              end
              local v_actual = actual[k]
              if not isCorrect(v_actual, v_expected) then
                  return false
              end
              actual[k]=nil
          end
      
          if next(actual) then 
              return false
          end
          return true
      else
          return actual == expected
      end
  end
  
  function validateSolution(actual, expected)
      return isCorrect(actual,expected)
  end
  
  function driver(arr1, arr2, m, n, x, expected)
      local exec_result;
      local status, error_msg = pcall(function () 
          exec_result=PLACEHOLDER_FN_NAME(arr1, arr2, m, n, x) 
      end)
      if status then
          if validateSolution(exec_result,expected) then
              return "PASSED"
          end
          return "FAILED"
      else
          return string.format("ERROR=%s",string.gsub(error_msg,".*:[%d]+: ",""))
      end
  end
      
  function main()
      result = driver({11, 13, 16, 23, 26, 28, 31, 34, 37, 39, 44, 48, 56, 59, 79, 91, 96, 98}, {1, 1, 9, 14, 17, 23, 26, 31, 33, 36, 53, 60, 71, 75, 76, 84, 87, 88}, 9, 15, 11, 0)
      print(string.format("TEST-0...%s",result))
  
      result = driver({50, 14, -98, 14, 90, 36, 66, 44, 10, -98, -24, -36, -32, -50}, {34, -6, -66, 0, -6, 82, 60, -98, -8, 60, -2, 4, 22, 76}, 11, 12, 8, 5)
      print(string.format("TEST-1...%s",result))
  
      result = driver({0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 14, 9, 12, 0)
      print(string.format("TEST-2...%s",result))
  
      result = driver({88, 14, 29, 87, 86, 58}, {91, 95, 64, 4, 63, 35}, 3, 5, 5, 0)
      print(string.format("TEST-3...%s",result))
  
      result = driver({-98, -92, -88, -86, -82, -76, -72, -66, -56, -48, -34, -28, -28, -26, -20, -18, -18, -16, -16, -12, -4, 0, 6, 12, 16, 20, 22, 30, 34, 34, 36, 56, 58, 62, 64, 80, 82, 94}, {-94, -90, -88, -84, -82, -78, -76, -72, -70, -58, -58, -46, -42, -40, -40, -32, -22, -20, -18, -12, -8, -6, 6, 6, 18, 20, 34, 46, 60, 62, 66, 72, 72, 76, 76, 78, 92, 98}, 34, 32, 23, 0)
      print(string.format("TEST-4...%s",result))
  
      result = driver({1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0}, {1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0}, 39, 26, 34, 0)
      print(string.format("TEST-5...%s",result))
  
      result = driver({70, 70, 74}, {15, 55, 84}, 1, 1, 1, 0)
      print(string.format("TEST-6...%s",result))
  
      result = driver({-20, -12, -50, 76, 24, 64, -22, -4, -68}, {18, 98, -88, 86, 72, -44, 82, 94, 58}, 5, 4, 7, 0)
      print(string.format("TEST-7...%s",result))
  
      result = driver({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 27, 26, 37, 0)
      print(string.format("TEST-8...%s",result))
  
      result = driver({68, 75, 51, 45, 73, 95, 48, 53, 70, 41, 65, 47, 46, 43, 79, 29, 50}, {4, 6, 76, 65, 16, 13, 85, 43, 31, 14, 81, 90, 24, 87, 40, 25, 88}, 10, 10, 9, 0)
      print(string.format("TEST-9...%s",result))
  
  end
  
  main()
source_py: def count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x(arr1, arr2, m, n, x):
      count = 0
      for i in range(m):
          for j in range(n):
              if ((arr1[i] + arr2[j]) == x):
                  count = (count + 1)
      return count
source_cpp: int count_pairs_two_sorted_arrays_whose_sum_equal_given_value_x(vector<int> arr1, vector<int> arr2, int m, int n, int x) {
    int count = 0;
    for ( int i = 0;
    i < m;
    i ++ ) for ( int j = 0;
    j < n;
    j ++ ) if ( ( arr1 [ i ] + arr2 [ j ] ) == x ) count ++;
    return count;
  }