Search⌘ K
AI Features

Solution: Nth Magical Number

Explore how to find the nth magical number that is divisible by either of two integers by applying the inclusion-exclusion principle and binary search. Understand the step-by-step approach to efficiently count and locate the target number without generating full sequences, gaining insights into time and space complexity in mathematical problem-solving.

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

  • ...