[BOJ] 1158 요세푸스 수열

from collections import deque
N,K = map(int,input().split())
deq = deque()
for i in range (1,N+1):
    deq.append(i)

cnt = 1
ans = []
while deq:
    x = deq.popleft()
    if cnt % K == 0:
        ans.append(x)
    else:
        deq.append(x)
    cnt += 1

s = "<" + ", ".join(str(t) for t in ans) + ">"
print(s)

 

덱으로 빠르게 풀 수 있었다.