๐๏ธ Algorithm/๐ฉ ๋ฐฑ์ค
๐ฉ [๋ฐฑ์ค] [Python] [Silver4] 2960๋ฒ_์๋ผํ ์คํ ๋ค์ค์ ์ฒด
Dbswnstjd
2023. 2. 19. 16:04
๋ฌธ์
https://www.acmicpc.net/problem/2960
2960๋ฒ: ์๋ผํ ์คํ ๋ค์ค์ ์ฒด
2, 4, 6, 8, 10, 3, 9, 5, 7 ์์๋๋ก ์ง์์ง๋ค. 7๋ฒ์งธ ์ง์์ง ์๋ 9์ด๋ค.
www.acmicpc.net
ํ์ด
# ๋ฐฑ์ค 2960๋ฒ ๋ฌธ์ - ์๋ผํ ์คํ
๋ค์ค์ ์ฒด
N, K = map(int, input().split())
tmp = 0
sieve = [True] * (N + 1)
for i in range(2, N + 1):
for j in range(i, N + 1, i):
if sieve[j] != False:
sieve[j] = False
tmp += 1
if tmp == K:
print(j)