Merge pull request #687 from baekhangyeol/main

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

Author: github-actions[bot]

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

@@ -0,0 +1,39 @@
+# P(1) = 1
+# P(2) = 1
+# P(3) = 1
+# P(4) = 2
+# P(5) = 2
+# P(6) = 3
+# P(7) = 4
+# P(8) = 5
+# P(9) = 7
+# P(10) = 9
+
+
+def main():
+    T = int(input())
+
+    for _ in range(T):
+        N = int(input())
+
+        if N <= 3:
+            print(1)
+            continue
+
+        P = [0 for _ in range(max(N, 5))]
+
+        P[0] = 1
+        P[1] = 1
+        P[2] = 1
+        P[3] = 2
+        P[4] = 2
+
+        for j in range(5, N):
+                P[j] = P[j-1] + P[j-5]
+
+
+        print(P[N-1])
+
+
+if __name__ == "__main__":
+    main()

live10/test104/문제2/백한결.py

@@ -0,0 +1,28 @@
+# 2-친구가 되는법
+# 1. A와 B가 친구
+# 2. A와 B는 친구가 아니지만 공통친구 C가 존재
+
+def main():
+    N = int(input())
+    A = [input().strip() for _ in range(N)]
+
+    friendsList = set()
+    numFriend = []
+
+    for i in range(N):
+        for j in range(N):
+            for k in range(N):
+               if i == j:
+                   continue
+               if A[i][j] == 'Y':
+                   friendsList.add(j)
+               else:
+                   if A[k][i] == 'Y' and A[k][j] == 'Y':
+                       friendsList.add(j)
+        numFriend.append(len(friendsList))
+        friendsList.clear()
+
+    print(max(numFriend))
+
+if __name__ == "__main__":
+    main()

live10/test104/문제3/백한결.py

@@ -0,0 +1,31 @@
+from collections import deque
+
+def isAdjacent(word1, word2):
+    diff_count = 0
+    for a, b in zip(word1, word2):
+        if a != b:
+            diff_count += 1
+        if diff_count > 1:
+            return False
+    return diff_count == 1
+
+
+def solution(begin, target, words):
+    if target not in words:
+        return 0
+
+    visited = set()
+    queue = deque()
+    queue.append((begin, 0))  # 현재 단어, count 수
+
+    while queue:
+        current, depth = queue.popleft()
+        if current == target:
+            return depth
+
+        for word in words:
+            if word not in visited and isAdjacent(current, word):
+                visited.add(word)
+                queue.append((word, depth + 1))
+
+    return 0