Merge pull request #181 from AlgoLeadMe/13-H0ngJu

13-H0ngJu
AlgoLeadMe · May 10, 2024 · 37bdeaf · 37bdeaf
2 parents 1eb3ce9 + 7a2b4fe
commit 37bdeaf
Show file tree

Hide file tree

Showing 3 changed files with 23 additions and 0 deletions.
diff --git a/H0ngJu/쉬운 계단 수.py → H0ngJu/DP/쉬운 계단 수.py b/H0ngJu/쉬운 계단 수.py → H0ngJu/DP/쉬운 계단 수.py
diff --git a/H0ngJu/README.md b/H0ngJu/README.md
@@ -14,5 +14,6 @@
 | 10차시 | 2024.04.03 |   BFS    |                  [숨바꼭질 4](https://www.acmicpc.net/problem/13913)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/177 |
 | 11차시 | 2024.04.07 |   구현   |                   [사탕 게임](https://www.acmicpc.net/problem/9095)                   | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/178 |
 | 12차시 | 2024.04.09 |   DFS    |                    [ABCDE](https://www.acmicpc.net/problem/13023)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/180 |
+| 13차시 | 2024.05.06 | 완전탐색 |                    [리모컨](https://www.acmicpc.net/problem/1107)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/181 |
 
 ---
diff --git a/H0ngJu/완전탐색/리모컨.py b/H0ngJu/완전탐색/리모컨.py
@@ -0,0 +1,22 @@
+import sys
+
+def input(): return sys.stdin.readline().rstrip()
+
+N = int(input())
+M = int(input())
+btn = list(map(int, input().rsplit()))
+
+target = abs(N-100)
+cnt = target
+
+for i in range(1000001):
+    check = True
+    for str_i in str(i):
+        if int(str_i) in btn:
+            check = False
+            break
+
+    if check:
+        cnt = min(cnt, abs(i - N)+len(str(i)))
+
+print(cnt)