g1701_1800.s1726_tuple_with_same_product

Class Solution

java.lang.Object

g1701_1800.s1726_tuple_with_same_product.Solution

public class Solution
extends Object

1726 - Tuple with Same Product.

Medium

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_._

Example 1:

Input: nums = [2,3,4,6]

Output: 8

Explanation: There are 8 valid tuples:

(2,6,3,4) , (2,6,4,3) , (6,2,3,4) , (6,2,4,3)

(3,4,2,6) , (4,3,2,6) , (3,4,6,2) , (4,3,6,2)

Example 2:

Input: nums = [1,2,4,5,10]

Output: 16

Explanation: There are 16 valid tuples:

(1,10,2,5) , (1,10,5,2) , (10,1,2,5) , (10,1,5,2)

(2,5,1,10) , (2,5,10,1) , (5,2,1,10) , (5,2,10,1)

(2,10,4,5) , (2,10,5,4) , (10,2,4,5) , (10,2,5,4)

(4,5,2,10) , (4,5,10,2) , (5,4,2,10) , (5,4,10,2)

Constraints:

• 1 <= nums.length <= 1000
• 1 <= nums[i] <= 104
• All elements in nums are distinct.

Constructor Summary

Constructors

Constructor and Description
Solution()

Method Summary

Modifier and Type	Method and Description
int	tupleSameProduct(int[] nums)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

Solution

public Solution()

Method Detail

tupleSameProduct

public int tupleSameProduct(int[] nums)