Search⌘ K
AI Features

Solution: Nth Magical Number

Explore how to find the nth magical number divisible by either of two integers using mathematical concepts and binary search. Learn to apply the inclusion-exclusion principle and efficient searching techniques to handle large constraints while returning results under modulo.

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

  • ...