#1808

Maximize Number of Nice Divisors

master · 1880 · lc hard +32 · verified · 35.4% accepted · 233 likes · top 13%

Description

Given positive integer primeFactors, construct n with at most primeFactors prime factors (with multiplicity) such that the number of nice divisors is maximized. A divisor of n is nice if it is divisible by every prime factor of n. Return the count of nice divisors modulo 10⁹ + 7.

Code

1

2

3

class Solution:
    def maxNiceDivisors(self, primeFactors: int) -> int:

class Solution:
    def maxNiceDivisors(self, primeFactors: int) -> int: