Finding number of integers which has exactly x divisors

def count_with_x_divisors_opt(n, x):
    def get_divisors(num):
        cnt = 0
        for i in range(1, int(num**0.5) + 1):
            if num % i == 0:
                cnt += 1
                if i*i != num: cnt += 1
        return cnt
    res = 0
    for i in range(1, n + 1):
        if get_divisors(i) == x: res += 1
    return res

def count_with_x_divisors_brute(n, x):
    count_ints = 0
    for i in range(1, n + 1):
        divs = 0
        for j in range(1, i + 1):
            if i % j == 0: divs += 1
        if divs == x: count_ints += 1
    return count_ints