complete 1158.py 11025.py 11866.py

zeta_python/11025.py

@@ -0,0 +1,9 @@
+def solve(N, K):
+    ret = 1
+    for i in range(2, N + 1):
+        ret = (ret + K - 1) % i + 1
+    return ret
+
+
+if __name__ == "__main__":
+    print(solve(*map(int, input().split())))

zeta_python/1158.py

@@ -0,0 +1,23 @@
+from collections import deque
+
+
+def solve(N, K):
+    q = deque(range(1, N + 1))
+    tq = deque()
+    cnt = 0
+    ret = []
+    while q:
+        while q:
+            cnt += 1
+            cnt %= K
+            if cnt % K == 0:
+                ret.append(q.popleft())
+            else:
+                tq.append(q.popleft())
+        q = tq
+        tq = deque()
+    return "<" + ", ".join(map(str, ret)) + ">"
+
+
+if __name__ == "__main__":
+    print(solve(*map(int, input().split())))

zeta_python/11866.py

@@ -0,0 +1,23 @@
+from collections import deque
+
+
+def solve(N, K):
+    q = deque(range(1, N + 1))
+    tq = deque()
+    cnt = 0
+    ret = []
+    while q:
+        while q:
+            cnt += 1
+            cnt %= K
+            if cnt % K == 0:
+                ret.append(q.popleft())
+            else:
+                tq.append(q.popleft())
+        q = tq
+        tq = deque()
+    return "<" + ", ".join(map(str, ret)) + ">"
+
+
+if __name__ == "__main__":
+    print(solve(*map(int, input().split())))