풀이시간: 14분
from collections import deque
card_q = deque()
for i in range(1, int(input()) + 1):
card_q.append(i)
while len(card_q) > 1:
card_q.popleft()
second_top = card_q.popleft()
card_q.append(second_top)
print(card_q[0])
from collections import deque
N = int(input())
dq = deque(range(1, N + 1))
while len(dq) > 1:
dq.popleft()
dq.append(dq.popleft())
print(dq.popleft())
일반 배열(리스트)로 풀면 안되는 이유