Project Euler #21

euler21.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 amicable(n):
    m = sum(divisors(n))
    if m != n and n == sum(divisors(m)):
        return 1
    return 0

print sum(x for x in range(10000) if amicable(x))