Distinct Prime Factors of Product of Array - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
2521. Distinct Prime Factors of Product of Array
Medium
30 Points
Array
Hash Table
Math
Number Theory
Given an array of positive integers nums, return the number of distinct prime factors in the product of the elements of nums.
Note that:
Examples
Example 1
Input: nums = [2,4,3,7,10,6]
Output: 4
Explanation:
The product of all the elements in nums is: 2 * 4 * 3 * 7 * 10 * 6 = 10080 = 25 * 32 * 5 * 7.
There are 4 distinct prime factors so we return 4.
Example 2
Input: nums = [2,4,8,16]
Output: 1
Explanation:
The product of all the elements in nums is: 2 * 4 * 8 * 16 = 1024 = 210.
There is 1 distinct prime factor so we return 1.
Constraints
1 <= nums.length <= 104
2 <= nums[i] <= 1000
2521. Distinct Prime Factors of Product of Array
Medium
30 Points
Array
Hash Table
Math
Number Theory
Given an array of positive integers nums, return the number of distinct prime factors in the product of the elements of nums.
Note that:
Examples
Example 1
Input: nums = [2,4,3,7,10,6]
Output: 4
Explanation:
The product of all the elements in nums is: 2 * 4 * 3 * 7 * 10 * 6 = 10080 = 25 * 32 * 5 * 7.
There are 4 distinct prime factors so we return 4.
Example 2
Input: nums = [2,4,8,16]
Output: 1
Explanation:
The product of all the elements in nums is: 2 * 4 * 8 * 16 = 1024 = 210.
There is 1 distinct prime factor so we return 1.