Add files via upload

Author: wSangbae

week15/bsw/14425_문자열 집합.py

@@ -0,0 +1,15 @@
+N, M = map(int, input().split())
+
+S = {}
+for _ in range(N):
+    S[input()] = 1
+
+check = [input() for _ in range(M)]
+
+
+ans=0
+for chk in check:
+    if chk in S:
+        ans+=1
+
+print(ans)

week15/bsw/1806_부분합.py

@@ -0,0 +1,24 @@
+N, S = map(int, input().split())
+lst = list(map(int,input().split()))
+
+l, r = 0, 0
+
+answers = []
+sum_nums = 0
+while l<=r and r<N:
+    print(lst[l], lst[r], sum_nums)
+    
+    if sum_nums < S:
+        sum_nums+=lst[r]
+        r+=1
+
+    elif sum_nums >= S:
+        answers.append(r-l)
+        sum_nums-=lst[l]
+        l+=1
+
+
+if not answers:
+    print(0)
+else: print(sorted(answers)[0])
+    

week15/bsw/3584_가장 가까운 공통 조상.py

@@ -0,0 +1,41 @@
+T = int(input())
+
+for _ in range(T):
+
+    N = int(input())
+
+    tree = {}
+    for _ in range(N-1):
+        parent, child = map(int, input().split())
+        tree[child] = parent
+
+    all_nodes = set([i for i in range(1,N+1)])
+    children = set(i for i in tree.keys())
+    root = (all_nodes-children).pop()
+    
+    tree[root] = -1
+
+    node1, node2 = map(int, input().split())
+
+    answers=[]
+    for cur in [node1, node2]:
+        visited=[]
+
+        while cur in tree.keys():
+            visited.append(cur)
+            cur = tree[cur]
+        
+        answers.append(visited)
+    # print(tree)
+    # print(answers)
+    visited1, visited2 = answers[0], answers[1]
+    
+    short = len(set(visited1) & set(visited2))
+
+    print(visited1[-short])
+    '''
+      2
+     3 
+    1 4
+    5
+    '''

week15/bsw/4358_생태학.py

@@ -0,0 +1,28 @@
+import sys
+input = sys.stdin.readline
+
+d= {}
+total=0
+while 1:
+    tree=input().strip('\n')
+    if not tree:
+        break
+    
+    if tree not in d:
+        d[tree] = 0
+    d[tree] += 1
+    total += 1
+    
+# print(total)
+
+# 이거왜안됨????????
+# 반례 : 50.00
+# 쓰레기 같은 문제
+# for key in sorted(d):
+#     print(key, round((d[key]*100)/total, 4))
+
+dic=sorted(d.items())
+for k, v in dic:
+    print(k, '%.4f' %round((v/total)*100, 4))
+
+print(round(4.33, 4))

week4/bsw/12906_새로운 하노이 탑.py

@@ -1,6 +1,4 @@
 #12906 새로운 하노이 탑
-<<<<<<< HEAD
-=======
 
 # 원판이 이동할 때마다 하노이 탑의 현재 상태를 저장해 재사용 해야 한다
 # DP로 접근 -> 실패 -> BFS로 접근해야 한다
@@ -75,4 +73,3 @@
             q.append((A, B + C[-1], C[0:-1], count+1))
 
 
->>>>>>> 8cf325e0cb82fd7c35edeb0f6e5599b40cf21d54