Question: 
Write a python function to find the number of divisors of a given integer.


Model's Code:
def divisor(n):
    count = 0
    for i in range(1, int(n**0.5) + 1):
        if n % i == 0:
            count += 1
            if i != n // i:
                count += 1
    return count



Sample Correct Code:
def divisor(n):
  for i in range(n):
    x = len([i for i in range(1,n+1) if not n % i])
  return x


Asserts:
assert divisor(15) == 4 
assert divisor(12) == 6
assert divisor(9) == 3


Tests:
Test 1 of 3: PASS
Test 2 of 3: PASS
Test 3 of 3: PASS

Test 96 of 974: 74/96 (77.08333333333334%): success