BAEKJOON PYTHON 2581 소수

Prob

---

Approach

1은 소수가 아니다.

---

Code

if __name__ == "__main__" :
    m = int(input())
    n = int(input())
    num = []
    is_break = 0
    for i in range(m, n + 1):
        if i == 1: continue
        for j in range(2, int(i ** 0.5) + 1):
            if i % j == 0:
                is_break = 1
                break
        if is_break == 1:
            is_break = 0
        else :
            num.append(i)

    if len(num) == 0:
        print(-1)
    else:
        print(sum(num))
        print(min(num))

 

출처

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