[백준 1158] 요세푸스 문제 - Python

from collections import deque
# 요세푸스 순열
import sys
input = sys.stdin.readline
n,k = map(int,input().split())
queue = deque([i for i in range(1,n+1)])
result = list()
cnt = 0
while len(result)<n:
    cnt +=1
    temp = queue.popleft()
    if cnt%k==0:
        result.append(str(temp))
    else:
        queue.append(temp)
print("<", ", ".join(result), ">", sep='')