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

  • abhijeetmaharan2
     + 0 comments
    def squares(a, b):
    
    # Find the smallest integer whose square is >= a
    start = math.ceil(math.sqrt(a))
    # Find the largest integer whose square is <= b
    end = math.floor(math.sqrt(b))
    # The count of perfect squares is the difference + 1
    return max(0, end - start + 1)