[ 백준/Python ] 나무자르기_2805
문제 정답 코드 result_data = 0 def cal(data, high): result = 0 for i in data: if i - high > 0: result += (i - high) return result def binary_search(start, end, data, m): global result_data if start > end: return mid = (start + end) // 2 result = cal(data, mid) if result >= m: result_data = mid binary_search(mid + 1, end, data, m) else: binary_search(start, mid - 1, data, m) def solved(): n, m = map(in..
[백준 / Python] 욕심쟁이 판다_1937
정답 코드 n = int(input()) data = [] dp = [[0 for _ in range(n)] for _ in range(n)] for _ in range(n): data.append(list(map(int, input().split()))) dx, dy = [-1, 1, 0, 0], [0, 0, -1, 1] def dfs(x, y): if dp[x][y]: return dp[x][y] dp[x][y] = 1 for i in range(4): nx, ny = x + dx[i], y + dy[i] if 0
