number-of-subarrays-with-gcd-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 greatest common divisor of the subarray&#39;s elements is <code>k</code>.

A subarray is a contiguous non-empty sequence of elements within an array.

The greatest common divisor of an array is the largest integer that evenly divides all the array elements.

&nbsp;
Example 1:

<pre>
Input: nums = [9,3,1,2,6,3], k = 3
Output: 4
Explanation: The subarrays of nums where 3 is the greatest common divisor of all the subarray&#39;s elements are:
- [9,3,1,2,6,3]
- [9,3,1,2,6,3]
- [9,3,1,2,6,3]
- [9,3,1,2,6,3]
</pre>

Example 2:

<pre>
Input: nums = [4], k = 7
Output: 0
Explanation: There are no subarrays of nums where 7 is the greatest common divisor 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;= 109</code></li>
</ul>

subarrayGCD

Number of Subarrays With GCD Equal to K

Find Greatest Common Divisor of Array

find-greatest-common-divisor-of-array

找出数组的最大公约数

Number of Subarrays With LCM Equal to K

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

最小公倍数等于 K 的子数组数目

Array

Math

Number Theory

给你一个整数数组&nbsp;<code>nums</code>&nbsp;和一个整数&nbsp;<code>k</code> ，请你统计并返回 <code>nums</code>&nbsp;的子数组中元素的最大公因数等于 <code>k</code>&nbsp;的子数组数目。

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

数组的最大公因数&nbsp;是能整除数组中所有元素的最大整数。

&nbsp;

示例 1：

<pre>输入：nums = [9,3,1,2,6,3], k = 3
输出：4
解释：nums 的子数组中，以 3 作为最大公因数的子数组如下：
- [9,3,1,2,6,3]
- [9,3,1,2,6,3]
- [9,3,1,2,6,3]
- [9,3,1,2,6,3]
</pre>

示例 2：

<pre>输入：nums = [4], k = 7
输出：0
解释：不存在以 7 作为最大公因数的子数组。
</pre>

&nbsp;

提示：

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