Leetcode 3116. Kth Smallest Amount With Single Denomination Combination

Given coin denominations where you may only use multiples of a single denomination, find the k-th smallest distinct amount in the union of those arithmetic sequences of multiples. The core challenge is efficiently counting how many distinct multiples are ≤ x (via LCM/inclusion–exclusion) and using that count to binary-search the k-th value.