Tap here to switch tabs
Problem
Submissions

Problem: Maximize Number of Nice Divisors

Maximize Number of Nice Divisors asks you to choose an integer with a prime-factor limit and maximize divisors divisible by all distinct prime factors. Return the maximum modulo a large prime.

Statement

You are given a positive integer primeFactors. You are asked to construct a positive integer n that satisfies the following conditions:

  • The total count of prime factors of n (with multiplicity) is at most primeFactors.

  • The count of nice divisors of n is maximized.

A divisor of n is considered nice if it is divisible by every distinct prime factor of n.

Return the maximum number of nice divisors of n. Since the answer may be very large, return it modulo 109+710^9 + 7.

Constraints:

  • 1≤1 \le primeFactors ≤109\le 10^9

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Maximize Number of Nice Divisors

Maximize Number of Nice Divisors asks you to choose an integer with a prime-factor limit and maximize divisors divisible by all distinct prime factors. Return the maximum modulo a large prime.

Statement

You are given a positive integer primeFactors. You are asked to construct a positive integer n that satisfies the following conditions:

  • The total count of prime factors of n (with multiplicity) is at most primeFactors.

  • The count of nice divisors of n is maximized.

A divisor of n is considered nice if it is divisible by every distinct prime factor of n.

Return the maximum number of nice divisors of n. Since the answer may be very large, return it modulo 109+710^9 + 7.

Constraints:

  • 1≤1 \le primeFactors ≤109\le 10^9