3336. Find the Number of Subsequences With Equal GCD

Given an integer array nums (1 ≤ nums.length ≤ 200, 1 ≤ nums[i] ≤ 200). Count the pairs of non-empty subsequences (seq1, seq2), disjoint in indices, whose GCD of seq1's elements equals the GCD of…