Skip to content

Commit 01ef267

Browse files
authored
Merge pull request #11 from JYP0824/main
JYP / 3월 5주차 / 3문제
2 parents ec6a8da + b404b7a commit 01ef267

File tree

3 files changed

+70
-0
lines changed

3 files changed

+70
-0
lines changed

JYP/덱 2.py

Lines changed: 37 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,37 @@
1+
import sys
2+
from collections import deque
3+
4+
input = sys.stdin.readline
5+
6+
deque = deque([])
7+
8+
n = int(input())
9+
for _ in range(n):
10+
order = input().split()
11+
match (order[0], len(deque) == 0):
12+
case ("1", _):
13+
deque.appendleft(int(order[1]))
14+
case ("2", _):
15+
deque.append(int(order[1]))
16+
case ("3", True):
17+
print(-1)
18+
case ("3", False):
19+
print(deque.popleft())
20+
case ("4", True):
21+
print(-1)
22+
case ("4", False):
23+
print(deque.pop())
24+
case ("5", _):
25+
print(len(deque))
26+
case ("6", True):
27+
print(1)
28+
case ("6", False):
29+
print(0)
30+
case ("7", True):
31+
print(-1)
32+
case ("7", False):
33+
print(deque[0])
34+
case ("8", True):
35+
print(-1)
36+
case ("8", False):
37+
print(deque[-1])

JYP/요세푸스 문제 0.py

Lines changed: 20 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,20 @@
1+
from collections import deque
2+
3+
queue = deque()
4+
answer = []
5+
6+
a, b = map(int, input().split())
7+
8+
for i in range(1, a+1):
9+
queue.append(i)
10+
11+
while queue:
12+
for i in range(b-1):
13+
queue.append(queue.popleft())
14+
answer.append(queue.popleft())
15+
16+
print("<",end='')
17+
for i in range(len(answer)-1):
18+
print("%d, "%answer[i], end='')
19+
print(answer[-1], end='')
20+
print(">")

JYP/풍선 터뜨리기.py

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
from collections import deque
2+
import sys
3+
4+
n = int(sys.stdin.readline())
5+
deque = deque(enumerate(map(int, sys.stdin.readline().split()), start=1))
6+
7+
for i in range(n):
8+
x = deque.popleft()
9+
print(x[0], end=' ')
10+
if x[1] > 0:
11+
deque.rotate(-(x[1] - 1))
12+
else:
13+
deque.rotate(-x[1])

0 commit comments

Comments
 (0)