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

Update sol1.py

Browse Source
This commit is contained in:
Sanders Lin 2018-12-07 02:29:04 +08:00 committed by GitHub
parent c3b8c51822
commit 60ec25ef7a
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
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)