Merge branch 'main' of https://github.com/oliveyoung-algorithm/algorithm

Author: uiop5809

.github/workflows/ai-review.yml

@@ -22,14 +22,14 @@ jobs:
           REVIEW_LANGUAGE: korean
 
       - name: Wait before retry (10초)
-        if: steps.attempt1.outcome == 'failure'
+        if: steps.attempt1.conclusion == 'failure'
         run: |
           echo "재시도 대기 중... (10초)"
           sleep 10
 
       - name: AI Review (Attempt 2)
         id: attempt2
-        if: steps.attempt1.outcome == 'failure'
+        if: steps.attempt1.conclusion == 'failure'
         continue-on-error: true
         uses: choam2426/AI-Algorithm-Mentor@v5
         with:
@@ -40,14 +40,14 @@ jobs:
           REVIEW_LANGUAGE: korean
 
       - name: Wait before retry (15초)
-        if: steps.attempt2.outcome == 'failure'
+        if: steps.attempt2.conclusion == 'failure'
         run: |
           echo "재시도 대기 중... (15초)"
           sleep 15
 
       - name: AI Review (Attempt 3)
         id: attempt3
-        if: steps.attempt2.outcome == 'failure'
+        if: steps.attempt2.conclusion == 'failure'
         continue-on-error: true
         uses: choam2426/AI-Algorithm-Mentor@v5
         with:
@@ -58,14 +58,14 @@ jobs:
           REVIEW_LANGUAGE: korean
 
       - name: Wait before retry (20초)
-        if: steps.attempt3.outcome == 'failure'
+        if: steps.attempt3.conclusion == 'failure'
         run: |
           echo "재시도 대기 중... (20초)"
           sleep 20
 
       - name: AI Review (Attempt 4)
         id: attempt4
-        if: steps.attempt3.outcome == 'failure'
+        if: steps.attempt3.conclusion == 'failure'
         continue-on-error: true
         uses: choam2426/AI-Algorithm-Mentor@v5
         with:
@@ -76,14 +76,14 @@ jobs:
           REVIEW_LANGUAGE: korean
 
       - name: Wait before retry (30초)
-        if: steps.attempt4.outcome == 'failure'
+        if: steps.attempt4.conclusion == 'failure'
         run: |
           echo "재시도 대기 중... (30초)"
           sleep 30
 
       - name: AI Review (Attempt 5)
         id: attempt5
-        if: steps.attempt4.outcome == 'failure'
+        if: steps.attempt4.conclusion == 'failure'
         uses: choam2426/AI-Algorithm-Mentor@v5
         with:
           GITHUB_TOKEN: ${{ secrets.GITHUB_TOKEN }}
@@ -93,7 +93,7 @@ jobs:
           REVIEW_LANGUAGE: korean
 
       - name: Check if all attempts failed
-        if: steps.attempt5.outcome == 'failure'
+        if: steps.attempt5.conclusion == 'failure'
         run: |
           echo "::error::모든 AI 리뷰 시도가 실패했습니다 (5회 시도)"
           exit 1 

README.md

@@ -67,7 +67,7 @@ algorithm/
 | 김지호 | 5000원  |
 | 심수연 | 0원  |
 | 정건우 | 0원  |
-| 공예영 | 3000원  |
+| 공예영 | 8000원  |
 
 ---
 

김지호/2주차/260109.py

@@ -0,0 +1,54 @@
+import sys
+
+# 재귀 깊이 제한 늘리기 (필수!)
+sys.setrecursionlimit(20000)
+
+class Node:
+  def __init__(self, value):
+    self.value = value
+    self.left = None   
+    self.right = None  
+
+class BinarySearchTree:
+  def __init__(self):
+    self.root = None 
+
+  def insert(self, value):
+    if self.root is None:
+      self.root = Node(value)
+      return
+
+    current = self.root
+    while True:
+      if value < current.value: 
+        if current.left is None: 
+          current.left = Node(value)
+          break
+        current = current.left 
+      else: 
+        if current.right is None:
+          current.right = Node(value)
+          break
+        current = current.right
+  
+    # 후위 순회
+    def print_postorder(self):
+      self._postorder_recursive(self.root)
+
+    def _postorder_recursive(self, node):
+      if node is not None:
+        self._postorder_recursive(node.left)   # Left
+        self._postorder_recursive(node.right)  # Right
+        print(node.value) 
+
+tree = BinarySearchTree()
+
+lines = sys.stdin.readlines()
+for line in lines:
+  try:
+    num = int(line.strip())
+    tree.insert(num)
+  except ValueError:
+    continue
+
+tree.print_postorder()

박예진/2주차/260109.cpp

@@ -0,0 +1,51 @@
+//https://www.acmicpc.net/problem/3584
+
+#include <algorithm>
+#include <iostream>
+using namespace std;
+
+int parent[10001];
+bool visited[10001];
+
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(NULL), cout.tie(NULL);
+
+  int T;
+  cin >> T;
+  
+  while (T--) {
+    int N; // 노드 수
+    cin >> N;
+    
+    for(int i = 1; i <= N; i++){
+      visited[i] = 0;
+      parent[i] = i;
+    }
+
+    for(int i = 0; i < N - 1; i++){
+      int A, B; // A가 B의 부모
+      cin >> A >> B; 
+      parent[B] = A;
+    }
+
+    // LCA 최소 공통 조상 찾기
+    int u,v;
+    cin >> u >> v;
+    visited[u] = 1;
+
+    // 루트 노드까지
+    while(u != parent[u]){
+      u = parent[u];
+      visited[u] = 1;
+    }
+    
+    while(true) {
+      if (visited[v]){
+        cout << v << "\n";
+        break;
+      }
+      v = parent[v];
+    }
+  }
+}

심수연/2주차/260109.py

@@ -0,0 +1,18 @@
+# https://www.acmicpc.net/problem/2798
+
+import sys
+input = sys.stdin.readline
+
+N, M = map(int, input().split())
+cards = list(map(int, input().split()))
+
+max_value = 0
+# 3장 -> i, j, k 3중 for문
+for i in range(N):
+  for j in range(i+1, N):
+    for k in range(j+1, N):
+      sum = cards[i] + cards[j] + cards[k]
+      if sum <= M and sum > max_value: # M보다 작거나 같고, 최댓값보다 크다면
+        max_value = sum # 최댓값 갱신
+      
+print(max_value)