[baekjoon]python #11866 요세푸스 문제0

https://www.acmicpc.net/problem/11866

11866번: 요세푸스 문제 0

from collections import deque

N,K=map(int,input().split())

q = deque()
answer = []

for i in range(1,N+1):
    q.append(i)

while q:
    for i in range(K-1):
        q.append(q.popleft()) #앞 요소들을 다시 뒤로 추가시켜주기!
    answer.append(q.popleft()) # K번째인거 answer array에 넣어주기

print('<',end='')
for i in range(len(answer)-1):
    print(answer[i],end=', ')
print(answer[-1],end='')
print('>')

2022.05.31 - [Problem Solving/ALGORITHM] - deque

deque