Merge pull request #109 from AlgoLeadMe/29-Dolchae

29-Dolchae

Dolchae/README.md

@@ -29,4 +29,5 @@
 | 25차시| 2024.02.01 | DP  | [1535 안녕](https://www.acmicpc.net/problem/1535) | [#89](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/89) |
 | 26차시| 2024.02.05 | 구현  | [18110 solved.ac](https://www.acmicpc.net/problem/18110) | [#93](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/93) |
 | 27차시| 2024.02.08 | 정렬  | [1302 베스트셀러](https://www.acmicpc.net/problem/1302) | [#97](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/97) |
-| 27차시| 2024.02.15 | 이진 탐색  | [6236 용돈 관리](https://www.acmicpc.net/problem/1302) | [#107](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/107) |
+| 28차시| 2024.02.15 | 이진 탐색  | [6236 용돈 관리](https://www.acmicpc.net/problem/1302) | [#107](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/107) |
+| 29차시| 2024.02.15 | 브루트포스  | [2961 도영이가 만든 맛있는 음식](https://www.acmicpc.net/problem/2961) | [#109](https://github.com/AlgoLeadMe/AlgoLeadMe-3/pull/109) |

Dolchae/브루트포스/2961 도영이가 만든 맛있는 음식n.py

@@ -0,0 +1,23 @@
+import sys
+from itertools import combinations
+input = sys.stdin.readline
+
+n = int(input())
+
+ingrid = [[0 for _ in range(2)] for _ in range(n)]
+for i in range(n):
+    ingrid[i][0],ingrid[i][1] = map(int,input().split())
+
+ans = abs(ingrid[0][0] - ingrid[0][1])
+for i in range(1,n+1): #1
+    for comb in combinations(ingrid,i): #2
+        print(comb)
+        sour, bitter = 1,0
+        for j in range(i): #3
+            sour *= comb[j][0]
+            bitter += comb[j][1]
+        now_diff = abs(sour-bitter)
+        if now_diff < ans: 
+            ans = now_diff
+
+print(ans)