number-of-subarrays-with-lcm-equal-to-k

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given an integer array <code>nums</code> and an integer <code>k</code>, return the number of subarrays of <code>nums</code> where the least common multiple of the subarray&#39;s elements is <code>k</code>.

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.

&nbsp;
Example 1:

<pre>
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&#39;s elements are:
- [3,6,2,7,1]
- [3,6,2,7,1]
- [3,6,2,7,1]
- [3,6,2,7,1]
</pre>

Example 2:

<pre>
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&#39;s elements.
</pre>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i], k &lt;= 1000</code></li>
</ul>

subarrayLCM

Number of Subarrays With LCM Equal to K

Number of Subarrays With GCD Equal to K

number-of-subarrays-with-gcd-equal-to-k

最大公因数等于 K 的子数组数目

Array

Math

Number Theory

给你一个整数数组 <code>nums</code> 和一个整数 <code>k</code> ，请你统计并返回 <code>nums</code> 的 子数组 中满足 元素最小公倍数为 <code>k</code> 的子数组数目。

子数组 是数组中一个连续非空的元素序列。

数组的最小公倍数 是可被所有数组元素整除的最小正整数。

&nbsp;

示例 1 ：

<pre>输入：nums = [3,6,2,7,1], k = 6
输出：4
解释：以 6 为最小公倍数的子数组是：
- [3,6,2,7,1]
- [3,6,2,7,1]
- [3,6,2,7,1]
- [3,6,2,7,1]
</pre>

示例 2 ：

<pre>输入：nums = [3], k = 2
输出：0
解释：不存在以 2 为最小公倍数的子数组。
</pre>

&nbsp;

提示：

<ul>
	<li><code>1 &lt;= nums.length &lt;= 1000</code></li>
	<li><code>1 &lt;= nums[i], k &lt;= 1000</code></li>
</ul>