algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-19 19:03:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

Simplify code by dropping support for legacy Python (#1143)

Browse Source 
* Simplify code by dropping support for legacy Python

* sort() --> sorted()
This commit is contained in:
Christian Clauss
2019-08-19 15:37:49 +02:00
committed by GitHub
parent 32aa7ff081
commit 47a9ea2b0b
145 changed files with 367 additions and 976 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
project_euler/problem_21/sol1.py
View File

@ -16,15 +16,9 @@ and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and
Evaluate the sum of all the amicable numbers under 10000.
"""
try:
xrange # Python 2
except NameError:
xrange = range # Python 3
def sum_of_divisors(n):
total = 0
for i in xrange(1, int(sqrt(n) + 1)):
for i in range(1, int(sqrt(n) + 1)):
if n % i == 0 and i != sqrt(n):
total += i + n // i
elif i == sqrt(n):