input: Write a function to take an integer as input and return a list of all its divisors. If the input number is zero, return an empty list.
  assert find_divisors(10)==[1, 2, 5, 10]
  assert find_divisors(15)==[1, 3, 5, 15]
  assert find_divisors(0)==[]
  assert find_divisors(25)==[1, 5, 25]
  assert find_divisors(1)==[1]
output: def find_divisors(n):
      if n == 0:
          return []
      return [i for i in range(1, n + 1) if n % i == 0]