We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Sherlock and Squares
  5. Discussions

Sherlock and Squares

  • alban_tyrex
     + 0 comments

    Here are my c++ solutions, you can watch the explanation here : https://youtu.be/LtU0ItsvbMI

    Solution 1 O(√n)

    int squares(int a, int b) {
    int i = ceil(sqrt(a)), result = 0;
    for(; i * i <= b; i++) result++;
    return result;
}

    Solution 2 O(1)

    int squares(int a, int b) {
    int i = ceil(sqrt(a)), j = floor(sqrt(b));
    return j - i + 1;
}