my code

def is_prime(n):
    for i in range(2, n):
        if n % i == 0:
            return False
    else:
        return True


def exact_multi_prime_divisor(num, power):
    divisor = 2
    buffer = 2
    counter = 0
    while num != 1:
        if num % divisor == 0:
            num /= divisor
            counter += 1
            if counter == power:
                buffer = divisor
            if buffer != divisor:
                print(buffer, end=" ")
                counter = 1
                buffer = divisor
        else:
            divisor += 1
            while not is_prime(divisor):
                divisor += 1
            counter = 0
    if counter == power:
        print(divisor, end="")