📝 [ 백준 ] Silver : 11047. 동전 0

Author: 0417taehyun

Baekjoon/Python/02_Silver/11047.py

@@ -0,0 +1,45 @@
+# [ 백준 ] 11047번: 동전 0
+
+def solution() -> None:
+    N, K = list(map(int, input().split(" ")))
+    A: list[int] = []
+    for _ in range(N):
+        coin: int = int(input())
+        if coin <= K:
+            A.insert(0, coin)
+    
+    answer: int = 0
+    for coin in A:
+        answer += (K // coin)
+        K %= coin
+    
+    print(answer)
+        
+
+if __name__ == "__main__":
+    import io
+    import unittest.mock
+
+
+    def test_example_case() -> None:
+        with unittest.mock.patch("builtins.input", side_effect=[
+            "10 4200",
+            "1",
+            "5",
+            "10",
+            "50",
+            "100",
+            "500",
+            "1000",
+            "5000",
+            "10000",
+            "50000",
+        ]):
+            with unittest.mock.patch("sys.stdout", new_callable=io.StringIO) as test_stdout:
+                solution()
+
+        assert test_stdout.getvalue() == "6\n"
+            
+            
+    test_example_case()
+    

README.md

@@ -1297,6 +1297,13 @@
     <td> <a href="https://velog.io/@dev_taehyun/algorithm-baekjoon-2839"> [ 알고리즘 ] 백준 2839번: 설탕 배달 </a> </td>
     <td> 2022. 06. 16 </td>
 </tr>
+<tr align="left">
+    <td> <a href="https://www.acmicpc.net/problem/11047"> 11047번: 동전 0 </a> </td>
+    <td> 그리디 알고리즘 </td>
+    <td> <a href="./Baekjoon/Python/02_Silver/11047.py"> 11047.py </a> </td>
+    <td> <a href="https://velog.io/@dev_taehyun/algorithm-baekjoon-11047"> [ 알고리즘 ] 백준 11047번: 동전 0 </a> </td>
+    <td> 2022. 06. 17 </td>
+</tr>
 </table>
 
 </details>