def is_prime(n):
if n==1:
return 0
elif n==2:
return 1
elif 0 not in [n%i for i in range(2,n)]:
return 1
else:
return 0
输出1~100的素数
filter(is_prime,range(1,101))
l
=
[]
for
n
in
range
(
1
,
101
):
if
n
=
=
1
:
continue
elif
n
=
=
2
:
l.append(
2
)
else
:
if
0
not
in
[n
%
i
for
i
in
range
(
2
,n)]:
l.append(n)
print
l
转载请注明原文地址: https://ju.6miu.com/read-678561.html
