11866번: 요세푸스 문제 0 (구현, 큐) - Tacademy

www.acmicpc.net/problem/11866

11866번: 요세푸스 문제 0

# 요세푸스 문제 0
# https://www.acmicpc.net/problem/11866 (구현, 큐)

from collections import deque


def nums(n, k):
    ret, queue = [], deque(range(1, n + 1))
    while queue:
        for _ in range(k - 1):
            queue.append(queue.popleft())
        ret.append(queue.popleft())
    return ret


n, k = map(int, input().split())
ans = nums(n, k)
print(f"<{', '.join(map(str, ans))}>")