题解 | 素数判断
素数判断
https://www.nowcoder.com/practice/5ab1b9690af047699e96c87dee65def4
import sys
import math
no = input()
def isPrime(i):
if i <= 1:
return False
for k in range(2,int(math.sqrt(i)+1)):
# form [2,√i] to find the key, if find, return False
if(i % k == 0):
return False
return True
for line in sys.stdin:
a = line.split()
print("Yes" if isPrime(int(a[0])) else "No")
查看3道真题和解析
