def is_prime(n): import math a = int(math.sqrt(n)) for i in range(2, a + 1): if n % i == 0: return False else: return True n = int(input()) if is_prime(n) == False: print(n)
python 判断素数
最新推荐文章于 2023-05-16 16:46:32 发布
def is_prime(n): import math a = int(math.sqrt(n)) for i in range(2, a + 1): if n % i == 0: return False else: return True n = int(input()) if is_prime(n) == False: print(n)