diff --git a/froglike6/README.md b/froglike6/README.md
index 09ec996..bcaf431 100644
--- a/froglike6/README.md
+++ b/froglike6/README.md
@@ -11,4 +11,5 @@
  | 7차시 | 2025.04.09 | 그래프 | [최소비용 구하기](https://www.acmicpc.net/problem/1916)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/27|
  | 8차시 | 2025.04.11 | 물리학 | [곰곰이와 시소](https://www.acmicpc.net/problem/26072)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/31|
  | 9차시 | 2025.04.30 | 기하학 | [평행사변형](https://www.acmicpc.net/problem/1064)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/34|
+ | 10차시 | 2025.05.08 | 이분탐색 | [게임](https://www.acmicpc.net/problem/1072)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/42|
  ---
diff --git a/froglike6/binary_search/1072.py b/froglike6/binary_search/1072.py
new file mode 100644
index 0000000..52cc719
--- /dev/null
+++ b/froglike6/binary_search/1072.py
@@ -0,0 +1,26 @@
+import sys
+input=sys.stdin.readline
+
+def solve(X, Y):
+    Z = (Y * 100) // X
+
+    if Z >= 99:
+        return -1
+
+    left, right = 1, 10**9
+    answer = -1
+
+    while left <= right:
+        mid = (left + right) // 2
+        new_Z = ((Y + mid) * 100) // (X + mid)
+
+        if new_Z > Z:
+            answer = mid
+            right = mid - 1
+        else:
+            left = mid + 1
+
+    return answer
+
+X, Y = map(int, input().split())
+print(solve(X, Y))
\ No newline at end of file