easyArrayHash Table 0 views
Find the Number of Good Pairs I
You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively.
You are given 2 integer arrays nums1 and nums2 of lengths n and m respectively. You are also given a positive integer k.
A pair (i, j) is called good if nums1[i] is divisible by nums2[j] * k (0 <= i <= n - 1, 0 <= j <= m - 1).
Return the total number of good pairs.
Example 1
Input: nums1 = [1,3,4], nums2 = [1,3,4], k = 1
Output: 5
Example 2
Input: nums1 = [1,2,4,12], nums2 = [2,4], k = 3
Output: 2
Explanation: The 2 good pairs are (3, 0) and (3, 1) .
Constraints
- 1 <= n, m <= 50
- 1 <= nums1[i], nums2[j] <= 50
- 1 <= k <= 50
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.