
def isPrime(num):
try:
num = int(num)
except:
return False
if num <= 1:
return False
else:
judge = True
for i in range(2,int(pow(num,0.5))+1):
if num % i == 0:
judge = False
break
return judge


被折叠的 条评论
为什么被折叠?



