input: Write a function to generate a list of all divisors of a given number provided by the user. If the number is negative or zero, return an empty list.
  def find_divisors(num):
      if num <= 0:
          return []
      divisors = []
      for i in range(1, num + 1):
          if num % i == 0:
              divisors.append(i)
      return divisors
  
  assert find_divisors(12) == [1, 2, 3, 4, 6, 12]
  assert find_divisors(0) == []
  assert find_divisors(-5) == []
  assert find_divisors(25) == [1, 5, 25]
  assert find_divisors(1) == [1]
output: def find_divisors(num):
      if num <= 0:
          return []
      divisors = []
      for i in range(1, num + 1):
          if num % i == 0:
              divisors.append(i)
      return divisors