41 lines
882 B
Python
41 lines
882 B
Python
|
import time
|
||
|
|
import concurrent.futures
|
||
|
|
import math
|
||
|
|
|
||
|
|
PRIMES = [
|
||
|
|
112272535095293,
|
||
|
|
112582705942171,
|
||
|
|
112272535095293,
|
||
|
|
115280095190773,
|
||
|
|
115797848077099,
|
||
|
|
1099726899285419]
|
||
|
|
|
||
|
|
def is_prime(n):
|
||
|
|
if n < 2:
|
||
|
|
return False
|
||
|
|
if n == 2:
|
||
|
|
return True
|
||
|
|
if n % 2 == 0:
|
||
|
|
return False
|
||
|
|
|
||
|
|
sqrt_n = int(math.floor(math.sqrt(n)))
|
||
|
|
for i in range(3, sqrt_n + 1, 2):
|
||
|
|
if n % i == 0:
|
||
|
|
return False
|
||
|
|
return True
|
||
|
|
|
||
|
|
def main():
|
||
|
|
with concurrent.futures.ProcessPoolExecutor() as executor:
|
||
|
|
start = time.time()
|
||
|
|
|
||
|
|
for number, prime in zip(PRIMES, executor.map(is_prime, PRIMES)):
|
||
|
|
print('%d is prime: %s' % (number, prime))
|
||
|
|
|
||
|
|
print(f'processing took {time.time() - start} seconds')
|
||
|
|
|
||
|
|
if __name__ == '__main__':
|
||
|
|
|
||
|
|
start = time.time()
|
||
|
|
main()
|
||
|
|
print(f'script took {time.time() - start} seconds')
|