Merge pull request #87 from learntosurf/main

Learntosurf / 11월 3주차 / 3문제

Author: zaqquum

.gitignore

@@ -0,0 +1,3 @@
+.cph/
+.DS_Store
+.DS_Store

learntosurf/.DS_Store

@@ -0,0 +1,39 @@
+import sys 
+input = sys.stdin.readline 
+
+money = int(input())
+machineduck = list(map(int, input().split())) 
+
+# 준현 
+j_stock = 0 
+j_money = money 
+
+for i in machineduck: 
+    if j_money >= i: 
+        j_stock += j_money // i 
+        j_money %= i
+
+# 성민 
+s_stock = 0 
+s_money = money 
+
+for i in range(3, len(machineduck)): 
+    if (machineduck[i-3] > machineduck[i-2]) and (machineduck[i-2] > machineduck[i-1]) and (machineduck[i-1] > machineduck[i]): 
+        if s_money >= machineduck[i]:
+            s_stock += s_money // machineduck[i] 
+            s_money %= machineduck[i]
+    
+    elif (machineduck[i-3]<machineduck[i-2]) and (machineduck[i-2]<machineduck[i-1]) and (machineduck[i-1]<machineduck[i]): 
+        if s_stock > 0: 
+            s_money += s_stock * machineduck[i] 
+            s_stock = 0
+
+j_result = j_money + j_stock * machineduck[-1]
+s_result = s_money + s_stock * machineduck[-1]
+
+if j_result > s_result: 
+    print("BNP")
+elif j_result < s_result:
+    print("TIMING")
+else: 
+    print("SAMESAME")

learntosurf/BruteForce/.cph/.2024-11-07-[BOJ]-#14717-앉았다.py_0bd4b78fdcfce942f4b0309901ad2256.prob

@@ -0,0 +1,42 @@
+import sys 
+input = sys.stdin.readline 
+
+board = [list(map(int, input().split())) for _ in range(5)]
+num = [int(x) for _ in range(5) for x in input().split()]
+
+visited = [[False] * 5 for _ in range(5)]
+bingo = 0 
+
+def update_visited(num, board, visited):
+    for row in range(5):
+        for col in range(5):
+            if board[row][col] == num:
+                visited[row][col] = True 
+
+def check_bingo(visited):
+    bingo = 0
+    
+    # 가로줄 검사 
+    for row in range(5):
+        if all(visited[row][col] for col in range(5)):
+            bingo += 1
+    
+    # 세로줄 검사
+    for col in range(5):
+        if all(visited[row][col] for row in range(5)):
+            bingo += 1
+    
+    # 대각선 검사
+    if all(visited[i][i] for i in range(5)):
+        bingo += 1
+    if all(visited[i][4-i] for i in range(5)):
+        bingo += 1
+    
+    return bingo 
+    
+
+for idx, i in enumerate(num, start=1):
+    update_visited(i, board, visited)
+    if check_bingo(visited) >= 3:
+        print(idx)
+        break

learntosurf/Simulation/2024-11-12-[BOJ]-#20545-기적의매매법.py

@@ -0,0 +1,16 @@
+N = int(input())
+schedule = [tuple(map(int, input().split())) for _ in range(N)]
+dp = [0] * (N + 1)
+
+# 뒤에서부터 dp 테이블 채우기
+for i in range(N - 1, -1, -1):
+    time, pay = schedule[i]
+    
+    # 상담을 할 수 있는 경우
+    if i + time <= N:
+        dp[i] = max(dp[i + 1], pay + dp[i + time])
+    else:
+        # 상담이 퇴사 이후까지 걸려서 할 수 없는 경우
+        dp[i] = dp[i + 1]
+
+print(dp[0])