๐Ÿ—๏ธ 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)