OpenSoure_Repos/TheAlgorithms-Python
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/Python.git synced 2023-10-11 13:06:12 +08:00
Code Issues Packages Projects Releases Wiki Activity

Improve Project Euler Problem 10 Sol-1 (#5773)

Browse Source 
* Improve Project Euler Problem 10 Sol-1

* Name correction

* psf/black formatting

* More formatting
This commit is contained in:
Rohan R Bharadwaj 2021-11-06 01:13:52 +05:30 committed by GitHub
parent 6b2b476f86
commit 48960268a2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 15 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
project_euler/problem_010/sol1.py
View File

@ -28,11 +28,11 @@ def is_prime(n: int) -> bool:
True True
""" """
for i in range(2, int(sqrt(n)) + 1): if 1 < n < 4:
if n % i == 0:
return False
return True return True
elif n < 2 or not n % 2:
return False
return not any(not n % i for i in range(3, int(sqrt(n) + 1), 2))
def solution(n: int = 2000000) -> int: def solution(n: int = 2000000) -> int:
@ -49,16 +49,7 @@ def solution(n: int = 2000000) -> int:
10 10
""" """
if n > 2: return sum(num for num in range(3, n, 2) if is_prime(num)) + 2 if n > 2 else 0
sum_of_primes = 2
else:
return 0
for i in range(3, n, 2):
if is_prime(i):
sum_of_primes += i
return sum_of_primes
if __name__ == "__main__": if __name__ == "__main__":