mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-27 23:11:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'patch-12' of git://github.com/SandersLin/Python

Browse Source
This commit is contained in:
harshildarji 2018-12-06 21:34:33 +01:00
commit d555a492dc
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
project_euler/problem_12/sol1.py
View File

@ -30,7 +30,9 @@ def count_divisors(n):
for i in xrange(1, int(sqrt(n))+1): for i in xrange(1, int(sqrt(n))+1):
if n%i == 0: if n%i == 0:
nDivisors += 2 nDivisors += 2
#check if n is perfect square
if n**0.5 == int(n**0.5):
nDivisors -= 1
return nDivisors return nDivisors
tNum = 1 tNum = 1
@ -43,4 +45,4 @@ while True:
if count_divisors(tNum) > 500: if count_divisors(tNum) > 500:
break break
print(tNum) print(tNum)