Merge pull request #96 from YoonYn9915/main

YoonYn9915/ 11월 3주차 / 3문제

Author: learntosurf

YoonYn9915/implementation/2024-11-23-[SWEA]-#1859-백만 장자 프로젝트.py

@@ -0,0 +1,20 @@
+N = int(input())
+ansList = []
+
+for i in range(N):
+    days = int(input())
+    costs = list(map(int, input().split()))
+    ans = 0
+
+    maxCost = -1
+
+    for j in range(len(costs) - 1, -1, -1):
+        if maxCost > costs[j]:
+            ans += maxCost - costs[j]
+        else:
+            maxCost = costs[j]
+
+    ansList.append(ans)
+
+for i in range(len(ansList)):
+    print(f"#{i + 1} {ansList[i]}")

YoonYn9915/implementation/2024-11-23-[SWEA]-#1954-달팽이 숫자.py

@@ -0,0 +1,48 @@
+N = int(input())
+
+for i in range(N):
+    num = int(input())
+
+    arr = [[-1] * num for _ in range(num)]
+    val = 1
+
+    row = 0
+    col = 0
+
+    dx = [-1, 1, 0, 0]
+    dy = [0, 0, -1, 1]
+
+    dir = 3
+
+    while True:
+
+        if val > num * num:
+            break
+
+        arr[row][col] = val
+        val += 1
+
+        newRow = row + dx[dir]
+        newCol = col + dy[dir]
+
+        if newRow >= num or newRow < 0 or newCol >= num or newCol < 0 or arr[newRow][newCol] != -1:
+            if dir == 0:
+                dir = 3
+            elif dir == 1:
+                dir = 2
+            elif dir == 2:
+                dir = 0
+            elif dir == 3:
+                dir = 1
+
+            row = row + dx[dir]
+            col = col + dy[dir]
+        else:
+            row = newRow
+            col = newCol
+
+    print(f"#{i+1}")
+    for j in range(num):
+        for k in range(num):
+            print(arr[j][k], end=" ")
+        print()

YoonYn9915/implementation/2024-11-23-[백준]-#1806-부분 합.py

@@ -0,0 +1,24 @@
+import sys
+
+# 입력 처리
+N, S = map(int, sys.stdin.readline().split())
+arr = list(map(int, sys.stdin.readline().split()))
+
+# 초기화
+ans = float('inf')
+start, end = 0, 0
+current_sum = 0
+
+# 투 포인터로 부분합 찾기
+while end < N:
+    current_sum += arr[end]
+    end += 1
+
+    # 현재 합이 S 이상일 경우
+    while current_sum >= S:
+        ans = min(ans, end - start)
+        current_sum -= arr[start]
+        start += 1
+
+
+print(0 if ans == float('inf') else ans)