[英]Use joblib to check whether an integer is a prime number or not. If it is, calculate its square; otherwise, append None to the returned value
import joblib
def is_prime(n):
for i in range(2, n):
if n % i == 0:
return False
return True
def square_if_prime(n):
if is_prime(n):
return n * n
return None
primes = joblib.Parallel(n_jobs=4)(joblib.delayed(square_if_prime)(n) for n in range(2, 100000))
primes = [prime for prime in primes if prime]
print(primes[:10])
try this:尝试这个:
def is_prime(n):
for i in range(2,int(n**0.5)+1):
if n%i==0:
return False
return True
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.