Merge pull request #61 from YoonYn9915/main

YoonYn9915/9월 2-3주차/4문제

Author: Mingguriguri

YoonYn9915/backtracking/2024-09-10-[백준]-#15649-N과 M.py

@@ -0,0 +1,21 @@
+def backtracking(cnt, arr):
+    global answer, N, M
+    if M == cnt:
+        answer.append(arr[:])  # 결과를 복사해서 저장
+        return
+
+    for i in range(1, N+1):
+        if i not in arr:  # 중복 방지
+            arr.append(i)
+            backtracking(cnt+1, arr)
+            arr.pop()  # 마지막 원소 제거로 백트래킹
+
+N, M = map(int, input().split())
+
+answer = []
+
+backtracking(0, [])
+
+# answer 리스트에서 하나씩 출력
+for ans in answer:
+    print(" ".join(map(str, ans)))

YoonYn9915/backtracking/2024-09-23-[백준]-#5568-카드 놓기.py

@@ -0,0 +1,37 @@
+n = int(input())
+k = int(input())
+
+card = []
+dp = [0] * n
+
+result = 0
+
+for _ in range(n):
+    card.append(int(input()))
+
+string = ''
+result = set()
+
+
+def select(cnt):
+    global string
+
+    if cnt == k:
+        result.add(string)
+        return
+
+    for i in range(n):
+        if dp[i] == 0:
+            dp[i] = 1
+
+            tmp = str(card[i])
+            string += tmp
+
+            select(cnt + 1)
+
+            dp[i] = 0
+            string = string[:-len(tmp)]
+
+
+select(0)
+print(len(result))

YoonYn9915/dp/2024-09-10-[백준]-#14501-퇴사.py

@@ -0,0 +1,22 @@
+
+N = int(input())
+
+T = [0]
+P = [0]
+dp = [0] * (N + 2)
+
+for _ in range(N):
+    arr = input().split()
+    T.append(int(arr[0]))
+    P.append(int(arr[1]))
+
+dp[N + 1] = 0
+
+
+for i in range(N, 0, -1):
+    if i + T[i] <= N + 1:
+        dp[i] = max(dp[i + 1], P[i] + dp[i + T[i]])
+    else:
+        dp[i] = dp[i + 1]
+
+print(dp[1])

YoonYn9915/math/2024-09-10-[백준]-#13458-시험 감독.py

@@ -0,0 +1,21 @@
+
+N = int(input())
+
+arr = list(map(int,input().split()))
+
+B,C = map(int,input().split())
+
+answer = 0
+
+for i in range(N):
+    arr[i] = arr[i] - B
+    answer += 1
+    if arr[i] <= 0:
+        continue
+
+    answer += arr[i] // C
+    if arr[i] % C != 0:
+        answer += 1
+
+
+print(answer)