計算輸入兩個正整數x,y(x<=y,包括x,y)素數和。函數isPrime用以判斷一個數是否素數,primeSum函數返回素數和
以下為源碼
def isPrime(n) :
for i in range(2,n):
if n % i == 0:
return 0
break
else:
return n
def primeSum(x,y):
e = 0
for n in range(x,y):
w = isPrime(n)
e = w + e
return e
x,y =map(int, input().split())
print(primeSum(x,y))
程序截圖