[백준 알고리즘] 11866번 요세푸스 문제 0 (Python)

<Python>

import collections

n, k = map(int, input().split())
result = []
queue = collections.deque([i for i in range(1, n + 1)])

while len(queue) > 0:
    for _ in range(k):
        if _ == k - 1:
            num = queue.popleft()
            result.append(num)
        else:
            num = queue.popleft()
            queue.append(num)

print("<" + ", ".join(list(map(str, result))) + ">")

 

▼링크

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

11866번: 요세푸스 문제 0