Number of Subarrays With LCM Equal to K
Given an integer array nums and an integer k, return the number of subarrays of nums where the least common multiple of the subarray's elements is k.
A subarray is a contiguous non-empty sequence of elements within an array.
The least common multiple of an array is the smallest positive integer that is divisible by all the array elements.
Example 1
Input
nums = [3,6,2,7,1], k = 6Output
4The subarrays whose least common multiple is 6 are [3,6], [3,6,2], [6], and [6,2].
Example 2
Input
nums = [3], k = 2Output
0There are no subarrays of nums where 2 is the least common multiple of all the subarray's elements.
Constraints
- 1 <= nums.length <= 1000
- 1 <= nums[i], k <= 1000