# Problem Statement Given an array `nums` of **distinct** positive integers, return _the number of tuples_ `(a, b, c, d)` _such that_ `a * b = c * d` _where_ `a`_,_ `b`_,_ `c`_, and_ `d` _are elements of_ `nums`_, and_ `a != b != c != d`_._ ## Constraints - $1 <= \text{nums.length} <= 1000$ - $1 <= \text{nums}[i] <= 10^4$ - All elements in `nums` are **distinct**. # Solution