백준 풀이
백준 2581번 파이썬
ag2개발자
2022. 8. 25. 21:33
a= int(input())
b=int(input())
arr=[]
dp=[1]*(b+1)
dp[0]=0
dp[1]=0
for i in range(2,b+1):
if dp[i]==0:
continue
for j in range(2,b//i+1):
dp[i*j]=0
for p in range(a,b+1):
if dp[p]==1:
arr.append(p)
if arr==[]:
print(-1)
else:
print(sum(arr))
print(min(arr))