[백준 알고리즘] 2581번 Python

문제 정보

 

제출 코드

m = int(input())
n = int(input())
total = n-m+1
sum_v = 0
min_v = 0

for i in range(m,n+1):
	if(i==2):
		sum_v += i
		min_v = i
	for j in range(2,i):
		if(i%j==0):
			total -= 1
			break
		if(j==i-1):
			sum_v += i
			if(min_v==0):
				min_v = i
		
if(total==0 or min_v==0):
	print(-1)
else:
	print(sum_v)
	print(min_v)