Merge remote-tracking branch 'upstream/main'

Author: Eric

.github/workflows/merge-and-generate-problems.yml

@@ -69,6 +69,9 @@ jobs:
 
           LIVE_GROUP=$(((NEXT_TEST - 1) / 10))
 
+          echo "NEXT_TEST=test$NEXT_TEST"
+          echo "LIVE_FOLDER=live$LIVE_GROUP"
+
           echo "NEXT_TEST=test$NEXT_TEST" >> $GITHUB_ENV
           echo "LIVE_FOLDER=live$LIVE_GROUP" >> $GITHUB_ENV
 
@@ -79,6 +82,7 @@ jobs:
           touch $LIVE_FOLDER/$NEXT_TEST/문제1/.gitkeep
           touch $LIVE_FOLDER/$NEXT_TEST/문제2/.gitkeep
           touch $LIVE_FOLDER/$NEXT_TEST/문제3/.gitkeep
+          echo "✅ Created folder: $LIVE_FOLDER/$NEXT_TEST"
 
       - name: Commit and Push Changes
         if: env.pr_found == 'true'

live0/test4/문제1/.gitkeep

@@ -0,0 +1,16 @@
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+graph = [list(map(int, input().split())) for _ in range(n)]
+
+
+for k in range(n):
+    for i in range(n):
+        for j in range(n):
+            if graph[i][k] == 1 and graph[k][j] == 1:
+                graph[i][j] = 1
+        
+for row in graph:
+    print(*row)

live0/test4/문제2/.gitkeep

@@ -0,0 +1,16 @@
+def main():
+    N = int(input())
+    A = [list(map(int, input().split())) for _ in range(N)]
+
+    for i in range(N):
+        for j in range(N):
+            for k in range(N):
+                if A[j][i] and A[i][k]:
+                    A[j][k] = 1
+
+    for num in A:
+        print(' '.join(map(str, num)))
+
+
+if __name__ == "__main__":
+    main()

live0/test4/문제3/.gitkeep

@@ -0,0 +1,24 @@
+const input = require("fs")
+  .readFileSync(
+    process.platform === "linux"
+      ? "/dev/stdin"
+      : require("path").join(__dirname, "input.txt"),
+    "utf8"
+  )
+  .toString()
+  .trim()
+  .split("\n")
+  .map((line) => line.split(" ").map(Number));
+
+function solution(input) {
+  const N = input[0][0];
+  const G = input.slice(1);
+
+  for (let k = 0; k < N; k++)
+    for (let i = 0; i < N; i++)
+      for (let j = 0; j < N; j++) if (G[i][k] && G[k][j]) G[i][j] = 1;
+
+  return G.map((row) => row.join(" ")).join("\n");
+}
+
+console.log(solution(input));

live10/test103/문제1/박희경.py

@@ -0,0 +1,44 @@
+"""
+dp[0] = -1
+dp[1] = -1
+dp[2] = -1
+dp[3] = 1
+dp[4] = -1
+dp[5] = 1
+dp[6] = 2
+dp[7] = -1
+dp[8] = 1(5) + 1(3) = 2     // dp[5] + dp[3]
+dp[9] = 3                   // dp[3] * 3
+dp[10] = 2                  // dp[5] * 2
+dp[11] = 1 + 2              // dp[5] + dp[6]
+dp[12] = 4                  // dp[6] * 2
+dp[13] =                    // dp[3] + dp[10]
+dp[14]                      // dp[5] + dp[9]
+dp[15] = 3                  // dp[5] * 3
+dp[16] = -1                 // dp[5] + dp[11]
+dp[17] = -1                 // dp[5] + dp[12]
+dp[18] = 3 + 1 = 4          // dp[3] + dp[15]
+
+"""
+
+import sys
+
+input = sys.stdin.readline
+
+n = int(input())
+
+dp = [-1] * 50001
+dp[3] = 1
+dp[5] = 1
+dp[6] = 2
+
+for i in range(8, n + 1):
+    if dp[i - 3] != -1:
+        dp[i] = dp[i - 3] + 1
+    if dp[i - 5] != -1:
+        dp[i] = dp[i - 5] + 1
+    # 3, 5kg로 나눌 수 있다면
+    if dp[i - 3] > 0 and dp[i - 5] > 0:
+        dp[i] = min(dp[i - 3], dp[i - 5]) + 1
+
+print(dp[n])

live10/test103/문제1/백한결.py

@@ -0,0 +1,20 @@
+def main():
+    N = int(input())
+
+    dp = [float('inf')] * (N + 1)
+    dp[0] = 0
+
+    for i in range(1, N+1):
+        if i >= 3 and dp[i - 3] != float('inf'):
+            dp[i] = min(dp[i], dp[i - 3] + 1)
+        if i >= 5 and dp[i - 5] != float('inf'):
+            dp[i] = min(dp[i], dp[i - 5] + 1)
+
+    if dp[N] == float('inf'):
+        dp[N] = -1
+
+    print(dp[N])
+
+
+if __name__ == "__main__":
+    main()

live10/test103/문제1/조진우.js

@@ -0,0 +1,28 @@
+const fs = require("fs");
+const path = require("path");
+
+const filePath =
+  process.platform === "linux"
+    ? "/dev/stdin"
+    : path.join(__dirname, "input.txt");
+
+const input = fs.readFileSync(filePath, "utf8").toString().trim();
+
+function solution(input) {
+  const sugar = input;
+  let [bag3, bag5] = [0, 0];
+  bag5 = Math.floor(sugar / 5);
+  bag3 = (sugar - bag5 * 5) / 3;
+
+  while (bag5 >= 0) {
+    if (bag3 === Math.floor(bag3)) return bag5 + bag3;
+
+    if (bag3 % 3 !== 0) {
+      --bag5;
+      bag3 = (sugar - bag5 * 5) / 3;
+    }
+  }
+  return -1;
+}
+
+console.log(solution(input));