代码解释
def prime(m):
flag=0
for i in range (2,m):
if m%i==0:
flag=1
break
return flag
a=eval(input())
b=int(a)
b=b+1 if b<a else b
count=5
while count>0:
if prime(b) is 0:
if count>1:
print(b,end=",")
else:
print(b,end="")
count=count-1
b=b+1
首先要定义一个函数,来甄别素数
def prime(m):
flag=0
for i in range (2,m):
if m%i==0:
flag=1
break
return flag