[백준] 11866번 요세푸스 문제 0 (파이썬)

11866번: 요세푸스 문제 0

 

코드

from collections import deque

n, k = map(int, input().split())

num_list = [i+1 for i in range(n)]
num_list = deque(num_list)

answer = []
def yocefus(num_list):
    for i in range(k-1):
        x = num_list.popleft()
        num_list.append(x)
    answer.append(num_list.popleft())

for i in range(n):
    yocefus(num_list)

answer = str(answer)
answer = answer.replace("[","<")
answer = answer.replace("]",">")
print(answer)