백준 2581 (파이썬)

1.문제

https://www.acmicpc.net/problem/2581

2.코드

import math
def prime(n):
    if n>1:
        for i in range(2,int(math.sqrt(n))+1):
            if n%i==0:
                return False
        return True
m=int(input())
n=int(input())
l=[]
for i in range(m,n+1):
    if prime(i) == True:
        l.append(i)
if len(l) == 0:
    print(-1)
else :
    print(sum(l))
    print(min(l))

3.코드해설