Merge pull request #703 from baekhangyeol/main

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

Author: github-actions[bot]

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

@@ -0,0 +1,20 @@
+def main():
+    expression = input()
+    numList = expression.split('-')
+    totalSum = 0
+    totalMinus = []
+
+
+    for i in numList[0].split('+'):
+        totalSum += int(i)
+
+    for i in range(1, len(numList)):
+        totalMinus.append(numList[i].split('+'))
+
+        for j in totalMinus.pop():
+            totalSum -= int(j)
+
+    print(totalSum)
+
+if __name__ == "__main__":
+    main()

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

@@ -0,0 +1,17 @@
+def main():
+    N, K = map(int, input().split())
+    dp = [[0] * (N + 1) for _ in range(K + 1)]
+
+    for i in range(K + 1):
+        dp[i][0] = 1
+
+    for i in range(1, K + 1):
+        for j in range(1, N + 1):
+            dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % 1000000000
+
+    print(dp[K][N])
+
+
+
+if __name__ == '__main__':
+    main()

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

@@ -0,0 +1,33 @@
+import sys
+from collections import defaultdict
+
+sys.setrecursionlimit(10**6)
+count = 0
+
+def main():
+    input = sys.stdin.readline
+    N, W = map(int, input().split())
+
+    tree = defaultdict(list)
+
+    for _ in range(N-1):
+        u, v = map(int, input().split())
+        tree[u].append(v)
+        tree[v].append(u)
+
+    def dfs(node, parent):
+        global count
+        isLeaf = True
+        for child in tree[node]:
+            if child != parent:
+                isLeaf = False
+                dfs(child, node)
+        if isLeaf:
+            count += 1
+
+    dfs(1, -1)
+
+    print(W / count)
+
+if __name__ == '__main__':
+    main()