#1819

Number of Different Subsequences GCDs

candidate master · 1570 · lc hard +32 · verified · 45.1% accepted · 436 likes · top 28%

Description

Given a positive integer array nums, return the count of distinct GCD values achievable as the GCD of at least one non-empty subsequence of nums.

Code

1

2

3

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

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