mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 09:10:16 +00:00
44254cf112
* Rename all Project Euler directories: Reason: The change was done to maintain consistency throughout the directory and to keep all directories in sorted order. Due to the above change, some config files had to be modified: 'problem_22` -> `problem_022` * Update scripts to pad zeroes in PE directories
58 lines
1.2 KiB
Python
58 lines
1.2 KiB
Python
"""
|
|
https://projecteuler.net/problem=10
|
|
|
|
Problem Statement:
|
|
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
|
|
|
|
Find the sum of all the primes below two million.
|
|
"""
|
|
import math
|
|
from itertools import takewhile
|
|
from typing import Iterator
|
|
|
|
|
|
def is_prime(number: int) -> bool:
|
|
"""Returns boolean representing primality of given number num.
|
|
>>> is_prime(2)
|
|
True
|
|
>>> is_prime(3)
|
|
True
|
|
>>> is_prime(27)
|
|
False
|
|
>>> is_prime(2999)
|
|
True
|
|
"""
|
|
if number % 2 == 0 and number > 2:
|
|
return False
|
|
return all(number % i for i in range(3, int(math.sqrt(number)) + 1, 2))
|
|
|
|
|
|
def prime_generator() -> Iterator[int]:
|
|
num = 2
|
|
while True:
|
|
if is_prime(num):
|
|
yield num
|
|
num += 1
|
|
|
|
|
|
def solution(n: int = 2000000) -> int:
|
|
"""Returns the sum of all the primes below n.
|
|
|
|
# The code below has been commented due to slow execution affecting Travis.
|
|
# >>> solution(2000000)
|
|
# 142913828922
|
|
>>> solution(1000)
|
|
76127
|
|
>>> solution(5000)
|
|
1548136
|
|
>>> solution(10000)
|
|
5736396
|
|
>>> solution(7)
|
|
10
|
|
"""
|
|
return sum(takewhile(lambda x: x < n, prime_generator()))
|
|
|
|
|
|
if __name__ == "__main__":
|
|
print(solution(int(input().strip())))
|