input: Write a function to return all the divisors of a given number as a list. If the input number is zero, return an empty list.
  assert find_divisors(12)==[1, 2, 3, 4, 6, 12]
  assert find_divisors(17)==[1, 17]
  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 []
      divisors = []
      for i in range(1, n + 1):
          if n % i == 0:
              divisors.append(i)
      return divisors