Project Euler Problem 21

pe21.py

#project euler problem 21
#http://projecteuler.net/problem=21
#auther @iizukak

#10000以下の友愛数の和を求める

def finddiv(n):
    ans = [0] 
    for i in range(1, n+1):
        tmp = 0
        for j in range(1, (i / 2) + 1):
            if i % j == 0:
                tmp += j
        ans.append(tmp)
    return ans

def findfriend(n):
    ans = 0
    a = finddiv(n)
    for i in range(1, len(a)):
        if a[i] < len(a) and a[i] != i and a[a[i]] == i:
            ans += i
            ans += a[i]
            a[i] = 0 #重複削除
    return ans

print(findfriend(10000))