Merge pull request #645 from baekhangyeol/main

[백한결] 96차 라이브 코테 제출

Author: github-actions[bot]

live9/test96/문제1/백한결.py

@@ -0,0 +1,44 @@
+from collections import deque
+
+
+def solution(board):
+    map = [list(row) for row in board]
+
+    G = (0, 0)
+    R = (0, 0)
+
+    for i in range(len(map)):
+        for j in range(len(map[0])):
+            if map[i][j] == 'R':
+                R = (i, j)
+            elif map[i][j] == 'G':
+                G = (i, j)
+
+    return bfs(map, G, R)
+
+
+def bfs(map, G, R):
+    queue = deque([(R[0], R[1], 0)])
+
+    visited = [[False] * len(map[0]) for _ in range(len(map))]
+    visited[R[0]][R[1]] = True
+
+    directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]
+
+    while queue:
+        x, y, move = queue.popleft()
+
+        if (x, y) == G:
+            return move
+
+        for dx, dy in directions:
+            nx, ny = x, y
+            while 0 <= nx + dx < len(map) and 0 <= ny + dy < len(map[0]) and map[nx + dx][ny + dy] != 'D':
+                nx += dx
+                ny += dy
+
+            if not visited[nx][ny]:
+                visited[nx][ny] = True
+                queue.append((nx, ny, move + 1))
+
+    return -1

live9/test96/문제2/백한결.py

@@ -0,0 +1,18 @@
+def solution(n):
+    start, end = 1, 1
+    current_sum = 1
+    count = 0
+
+    while start <= n:
+        if current_sum == n:
+            count += 1
+            current_sum -= start
+            start += 1
+        elif current_sum < n:
+            end += 1
+            current_sum += end
+        else:
+            current_sum -= start
+            start += 1
+
+    return count

live9/test96/문제3/백한결.py

@@ -0,0 +1,20 @@
+def solution(elements):
+    prefix_sum = [0] * (len(elements) + 1)
+    sums = set()
+
+    for i in range(len(elements)):
+        prefix_sum[i + 1] = prefix_sum[i] + elements[i]
+
+    for length in range(1, len(elements) + 1):
+        for start in range(len(elements)):
+            end = (start + length) % len(elements)
+
+            # 일반적인 수열이므로 end까지의 합에서 start까지의 합을 뺌
+            if start < end:
+                part_sum = prefix_sum[end] - prefix_sum[start]
+            # 원형 수열이므로 전체의 합에서 start까지의 합을 빼고 end까지를 더함
+            else:
+                part_sum = (prefix_sum[len(elements)] - prefix_sum[start]) + prefix_sum[end]
+            sums.add(part_sum)
+
+    return len(sums)