#2470

Number of Subarrays With LCM Equal to K

specialist · 970 · lc medium +32 · verified · 43.5% accepted · 384 likes · top 25%

Description

Given an integer array nums and an integer k, count how many contiguous non-empty subarrays of nums have a least common multiple exactly equal to k.

The least common multiple of an array is the smallest positive integer divisible by every element in the array.

Example 1:

Input: nums = [3,6,2,7,1], k = 6

Output: 4

Explanation: The subarrays of nums where 6 is the least common multiple of all the subarray's elements are:

- [3,6,2,7,1]

Example 2:

Input: nums = [3], k = 2

Output: 0

Explanation: There are no subarrays of nums where 2 is the least common multiple of all the subarray's elements.

Code

1

2

3

class Solution:
    def subarrayLCM(self, nums: List[int], k: int) -> int:

class Solution:
    def subarrayLCM(self, nums: List[int], k: int) -> int: