diff --git a/zeta_python/11025.py b/zeta_python/11025.py
new file mode 100644
index 0000000..529c3f3
--- /dev/null
+++ b/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())))
diff --git a/zeta_python/1158.py b/zeta_python/1158.py
new file mode 100644
index 0000000..0c3eb61
--- /dev/null
+++ b/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())))
diff --git a/zeta_python/11866.py b/zeta_python/11866.py
new file mode 100644
index 0000000..0c3eb61
--- /dev/null
+++ b/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())))
diff --git a/zeta_python/18870.py b/zeta_python/18870.py
new file mode 100644
index 0000000..d4f0c75
--- /dev/null
+++ b/zeta_python/18870.py
@@ -0,0 +1,2 @@
+def solve(N, X):
+    
\ No newline at end of file
diff --git a/zeta_python/1966.py b/zeta_python/1966.py
new file mode 100644
index 0000000..8eda821
--- /dev/null
+++ b/zeta_python/1966.py
@@ -0,0 +1,16 @@
+from collections import deque
+
+
+def case(N, M, I):
+    q_id = deque(range(N))
+    q_priority = deque(I)
+
+    q_m_p = q_priority[M]
+
+    q_id
+
+
+if __name__ == "__main__":
+    T = int(input())
+    for _ in range(T):
+        print(case(*map(int, input().split()), list(map(int, input().split()))))
diff --git a/zeta_python/19940.py b/zeta_python/19940.py
new file mode 100644
index 0000000..e69de29
diff --git a/zeta_python/completed/19939.py b/zeta_python/completed/19939.py
new file mode 100644
index 0000000..58e0e54
--- /dev/null
+++ b/zeta_python/completed/19939.py
@@ -0,0 +1,13 @@
+def solve(N, K):
+    Kp = (K * (K + 1)) // 2
+    if N < Kp:
+        return -1
+    else:
+        N -= Kp
+        r = N % K
+        return sum((K - 1, 1 if r > 0 else 0))
+
+
+if __name__ == '__main__':
+    N, K = map(int, input().split())
+    print(solve(N, K))