solve : 11866 요세푸스 문제 0

python/boj_11866.py

@@ -0,0 +1,33 @@
+import sys
+from collections import deque
+
+input = sys.stdin.readline
+
+
+def solution(n, k):
+    queue = deque([i for i in range(1, n+1)])
+    answer = list()
+
+    while len(queue) > 0:
+        for _ in range(k-1):
+            tmp = queue.popleft()
+            queue.append(tmp)
+        num = queue.popleft()
+        answer.append(str(num))
+
+    return answer
+
+
+def display_result(answer):
+    print("<", end="")
+    print(", ".join(answer), end="")
+    print(">", end="")
+
+
+def main():
+    n, k = map(int, input().split())
+    answer = solution(n, k)
+    display_result(answer)
+
+
+main()