file | name | src | tags | done | draft | level | difficulty | date | |||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2960.py |
에라토스테네스의 체 |
|
true |
false |
7 |
Silver IV |
2021-11-02 |
import sys
def input(): return sys.stdin.readline().rstrip()
def solve(n, k):
arr = [True for _ in range(n+1)]
idx = 0
for i in range(2, n + 1):
for j in range(i, n + 1, i):
if arr[j]:
arr[j] = False
idx += 1
if idx == k:
return j
return -1
n, k = map(int, input().split())
print(solve(n, k))