title: Pair With Given Product Set 1 Find If Any Pair Exists
signature: function pairWithGivenProductSet1FindIfAnyPairExists($arr, $n, $x) {
test_code: <?php
  
  
  // SOLUTION CODE 
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  function validateSolution($actual, $expected){
      return serialize($actual) == serialize($expected);
  }
  
  function driver($arr, $n, $x, $expected){
      try{
        if (validateSolution(PLACEHOLDER_FN_NAME($arr, $n, $x), $expected)){
          return "PASSED";
        }
        return "FAILED";
      }
      catch (Exception $exception_obj) {
        return get_class($exception_obj);
      }
  }
  
  function main(){
      printf("TEST-0...%s\n",driver(
        array(10, 20, 9, 40), 4, 400, 
        true));
      
      printf("TEST-1...%s\n",driver(
        array(1, -10, 20, 9, -40), 5, 400, 
        true));
      
      printf("TEST-2...%s\n",driver(
        array(0, 0, 0, 0, 0, 1, 1, 1, 1), 7, 8, 
        false));
      
      printf("TEST-3...%s\n",driver(
        array(4, 10, 20, 9, -40), 5, -400, 
        true));
      
      printf("TEST-4...%s\n",driver(
        array(-90, -86, -76, -72, -70, -62, -56, -50, -18, -12, -10, 4, 16, 26, 42, 48, 52, 54, 54, 70, 84, 86, 88, 98), 23, 23, 
        false));
      
      printf("TEST-5...%s\n",driver(
        array(1), 0, 0, 
        false));
      
      printf("TEST-6...%s\n",driver(
        array(4, 7, 14, 14, 16, 18, 19, 20, 22, 24, 29, 38, 38, 38, 40, 40, 46, 46, 47, 51, 51, 52, 55, 56, 56, 62, 62, 62, 78, 79, 81, 84, 86, 88, 89, 89, 89), 23, 32, 
        false));
      
      printf("TEST-7...%s\n",driver(
        array(72, 80, -82, 24, -98, 90, -32, -56, -22, 8, -12, 8, -78, 60, -62, 50, 12, -60, 10, -54, 74, 98, 26, 56, 24), 21, 19, 
        false));
      
      printf("TEST-8...%s\n",driver(
        array(0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1), 22, 18, 
        false));
      
      printf("TEST-9...%s\n",driver(
        array(93, 40, 48, 99, 95, 59, 43, 58, 79, 70, 28), 9, 5, 
        false));
      
  }
  
  main();
  ?>
source_py: def pair_with_given_product_set_1_find_if_any_pair_exists(arr, n, x):
      for i in arr:
          for j in arr:
              if ((i * j) == x):
                  return True
      return False
source_cpp: bool pair_with_given_product_set_1_find_if_any_pair_exists(vector<int> arr, int n, int x) {
    for ( int i = 0;
    i < n - 1;
    i ++ ) for ( int j = i + 1;
    i < n;
    i ++ ) if ( arr [ i ] * arr [ j ] == x ) return true;
    return false;
  }