0 out of 464 challenges solved
Write a Python function `count_primes(n)` that takes a non-negative integer `n` and returns the count of prime numbers less than `n`. A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. #### Example Usage ```python [main.nopy] count_primes(5) # Output: 2 (primes are 2, 3) count_primes(10) # Output: 4 (primes are 2, 3, 5, 7) count_primes(0) # Output: 0 (no primes less than 0) count_primes(1) # Output: 0 (no primes less than 1) ```
def count_primes(n):
"""
Count the number of prime numbers less than a given non-negative integer n.
Args:
n (int): A non-negative integer.
Returns:
int: The count of prime numbers less than n.
"""
# Placeholder for the solution
pass