mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Updated Euler problem 21 sol1.py

Browse Source
This commit is contained in:
Sanders Lin 2019-04-20 00:00:40 +08:00 committed by Tapasweni Pathak
parent a170997eaf
commit a91f0e7ca0
1 changed files with 2 additions and 14 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

16
project_euler/problem_21/sol1.py
View File

@ -24,19 +24,7 @@ def sum_of_divisors(n):
total += i + n//i
elif i == sqrt(n):
total += i
return total-n
sums = []
total = 0
for i in xrange(1, 10000):
n = sum_of_divisors(i)
if n < len(sums):
if sums[n-1] == i:
total += n + i
sums.append(n)
print(total)
total = [i for i in range(1,10000) if sum_of_divisors(sum_of_divisors(i)) == i and sum_of_divisors(i) != i]
print(sum(total))