백준 11866 - 요세푸스 문제 0 (파이썬)

Answer

import sys
from collections import deque
n, k = map(int, sys.stdin.readline().split())
q = deque([i for i in range(1, n + 1)])
a = []

while q:
    for _ in range(k - 1):
        q.append(q.popleft())
    a.append(q.popleft())
    
print('<', end = '')
print(*a, sep = ', ', end = '')
print('>', end = '')