CPMagical CP Library

Problem solution · C++

Count K Th Roots in a Range

Count K Th Roots in a Range: a C++ solution using binary search. Learn the idea, check the complexity, and read the full code, with credit to Kamyu LeetCode Solutions.

Technique
Binary search
Source
Kamyu LeetCode Solutions
Length
29 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Binary search

For Count K Th Roots in a Range, the implementation exploits a monotonic condition to discard half of the remaining search space after every check.

  1. Identify the ordered answer range or sorted search domain.
  2. Write a predicate whose truth changes only once.
  3. Move the appropriate boundary after each midpoint check and return the final feasible position.

Code notes

  • 29 lines of C++ from the credited upstream file count-k-th-roots-in-a-range.cpp.
  • The implementation visibly relies on sequence storage.
  • 1 loop block detected.

Complexity

Multiply the logarithmic number of midpoint checks by the cost of one predicate evaluation.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from Kamyu LeetCode Solutions by kamyu104 and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCount K Th Roots in a Range · C++C++
Use this to learn the idea, then write your own version.
// Time:  O(logr * logk)// Space: O(1) // binary search, fast exponentiationclass Solution {public:    int countKthRoots(int l, int r, int k) {        const auto& binary_search_right = [](int left, int right, const auto& check) {            while (left <= right) {                const auto& mid = left + (right - left) / 2;                if (!check(mid)) {                    right = mid - 1;                } else {                    left = mid + 1;                }            }            return right;        };         const auto& count = [&](int right) {            return binary_search_right(0, right, [&](int x) {                return pow(x, k) <= right;            }) - 0 + 1;        };         return count(r) - count(l - 1);    }};

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗