Kth Smallest Number in Multiplication Table LeetCode solution in Python

1
class Solution:
2
    def findKthNumber(self, m, n, k):
3
        def count(x):
4
            return sum(min(x // i, n) for i in range(1, m + 1))
5

6
        L, R, mid, ans = 0, m * n, 0, 0
7
        while L <= R:
8
            mid = (L + R) >> 1
9
            if count(mid) < k:
10
                L = mid + 1
11
            else:
12
                R, ans = mid - 1, mid
13
        return ans