알고리즘 문제/알고리즘 문제풀이
백준 2164 카드2(큐)
태윤2
2020. 10. 25. 19:57
1
2
3
4
5
6
7
8
9
10
11
12
13
|
import sys
from collections import deque
n = int(sys.stdin.readline())
queue = deque()
for i in range(n):
queue.append(i+1)
while len(queue) > 1:
queue.popleft()
queue.append(queue.popleft())
print(queue.popleft)
|
cs |