这个题目怎么回答,有没有朋友给我解答一下,麻烦各位了,有点急
def isPrime(n):
for i in range(2,n):
if n%i==0:
return False
return True
m, n = 2, 12
for i in range(m,n+1):
if isPrime(i):
print(i)
m, n = map(int,input().split())
a = set(range(m,n+1))
for i in range(2,int(n/2)+1):
b = set(range(i,n+1,i))-{i}
a-=b
for i in a:
print(i)