Search⌘ K
AI Features

Solution: Nth Magical Number

Understand how to calculate the nth magical number divisible by integers a or b efficiently. Explore using the inclusion-exclusion formula and binary search to handle large constraints, ensuring fast and optimized coding solutions in C++.

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

  • ...