Search⌘ K
AI Features

Solution: Nth Magical Number

Discover how to find the nth magical number divisible by either of two given integers by applying the inclusion-exclusion principle and binary search. This lesson guides you through breaking down the problem efficiently, understanding the mathematical approach, implementing the algorithm, and optimizing for large input constraints.

Statement

Given three integers n, a, and b, return the nth magical number.

A magical number is defined as a positive integer that is divisible by either a or b.

As the result may be very large, return it modulo 109+710^9+7.

Constraints:

  • 11 \leq n 109\leq 10^9

  • ...