백준 알고리즘/구현
백준 1929번
paysmile
2018. 9. 11. 18:14
def isPrime(num):
if num<2:
return False
elif num==2:
return True
else:
i = int(math.sqrt(num))
for j in range(2,i+1):
if num%j ==0:
return False
return True
a,b = map(int, input().split())
for i in range(a,b+1):
if isPrime(i):
print(i)