소인수 분해

def factorize(n):

    def isPrime(n):

        return not [x for x in xrange(2,int(math.sqrt(n)))

                    if n%x == 0]

    primes = []

    candidates = xrange(2,n+1)

    candidate = 2

    while not primes and candidate in candidates:

        if n%candidate == 0 and isPrime(candidate):

            primes = primes + [candidate] + factorize(n/candidate)

        candidate += 1            

    return primes