Project Euler #32

euler32.py

from math import sqrt

def divisors(n):
    for x in xrange(1, int(sqrt(n)) + 1):
        if n % x == 0:
            yield x
            if x != 1 and x * x != n:
                yield n / x

def pandigital(l):
    return ''.join(sorted(''.join(str(n) for n in l))) == '123456789'

print sum(set(i for i in range(1, 10000)
                    for j in divisors(i)
                        if pandigital([i, j, i/j])))