title: Count Pairs Whose Products Exist In Array
signature: countPairsWhoseProductsExistInArray(arr, n) {
test_code: import 'dart:convert';
  
  // SOLUTION CODE
  // ============================================
  PLACEHOLDER_CODE_BODY
  
  // TESTING CODE 
  // ============================================
  bool validateSolution(int actual, int expected){
      return actual.toString() == expected.toString();
  }
  
  String driver(arr, n, int expected){
      try
      {
          if (validateSolution(PLACEHOLDER_FN_NAME(arr, n), expected)){
              return "PASSED";
          }
          return "FAILED";
      }catch(exception_object){
          return exception_object.runtimeType.toString();
      }
  }
  
  int main() {
  
      print("TEST-0...${driver(
          [3, 7, 26, 40, 46, 89, 99], 5, 
          0)
      }");
  
      print("TEST-1...${driver(
          [98, 42, -24, -60, 74, 86, 6, 8, 72, -58, 38, -20, 6, -6, 8, 48, -34, 30, 60, 66, 38, -54, 8, -94, -8, 0, -64, -94, -94, -72, -84, -36, 88, -62, -88, 46, -4, 88], 24, 
          6)
      }");
  
      print("TEST-2...${driver(
          [0, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1], 44, 
          946)
      }");
  
      print("TEST-3...${driver(
          [37, 97, 57, 82, 29, 68, 94, 38, 81, 48, 13, 84, 57, 5, 27, 87, 11, 35, 82, 53, 67, 31, 15, 99, 6, 93, 91, 92, 3, 23, 90, 27, 6, 33, 78, 3, 19, 19, 27], 36, 
          18)
      }");
  
      print("TEST-4...${driver(
          [-80, -74, -72, -72, -66, -66, -62, -50, -44, -44, -28, -24, -24, -22, -16, -10, -6, -4, -2, 2, 2, 4, 12, 16, 16, 28, 30, 32, 32, 38, 38, 72, 84, 86, 88, 90, 96], 34, 
          15)
      }");
  
      print("TEST-5...${driver(
          [0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1], 18, 
          153)
      }");
  
      print("TEST-6...${driver(
          [25, 67], 1, 
          0)
      }");
  
      print("TEST-7...${driver(
          [82, 74, -82, 22, -28, -78, -22, -86, -74, 42, -6, 54, -88, -92, -14, -50, 68, 46, -50, 46, -18, 66, -76, -30, 36, 12, 66], 14, 
          0)
      }");
  
      print("TEST-8...${driver(
          [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, 1, 1, 1, 1, 1, 1], 32, 
          496)
      }");
  
      print("TEST-9...${driver(
          [50, 23, 56, 9], 3, 
          0)
      }");
  
      return 0;
  }
source_py: def count_pairs_whose_products_exist_in_array(arr, n):
      result = 0
      for i in range(0, n):
          for j in range((i + 1), n):
              product = (arr[i] * arr[j])
              for k in range(0, n):
                  if (arr[k] == product):
                      result = (result + 1)
                      break
      return result
source_cpp: int count_pairs_whose_products_exist_in_array(vector<int> arr, int n) {
    int result = 0;
    for ( int i = 0;
    i < n;
    i ++ ) {
      for ( int j = i + 1;
      j < n;
      j ++ ) {
        int product = arr [ i ] * arr [ j ];
        for ( int k = 0;
        k < n;
        k ++ ) {
          if ( arr [ k ] == product ) {
            result ++;
            break;
          }
        }
      }
    }
    return result;
  }