1 week

Author: yunjaeeun44

01-240319/yunjaeeun44/1002.py

@@ -0,0 +1,12 @@
+T = int(input())
+for i in range(T):
+    x1, y1, r1, x2, y2, r2 = map(int, input().split())
+    distance = ((x1-x2)**2 + (y1-y2)**2)**(1/2)
+    if distance==0 and r1==r2: #동일
+        print(-1)
+    elif abs(r1-r2)==distance or r1+r2==distance: #내접, 외접
+        print(1)
+    elif abs(r1-r2) < distance < (r1+r2) : #두 점에서 만날 때
+        print(2)
+    else:
+        print(0)

01-240319/yunjaeeun44/1003.py

@@ -0,0 +1,7 @@
+T = int(input())
+for _ in range(T):
+    N = int(input())
+    a, b = 1, 0
+    for i in range(N):
+        a, b = b, a+b #DP
+    print(a, b)

01-240319/yunjaeeun44/1004.py

@@ -0,0 +1,16 @@
+T = int(input())
+for _ in range(T):
+    x1, y1, x2, y2 = map(int, input().split())
+    answer = 0
+    N = int(input())
+    for i in range(N):
+        cx, cy, r = map(int, input().split())
+        distance1 = ((cx-x1)**2 + (cy-y1)**2)**(1/2) #출발점과 원 중심의 거리
+        distance2 = ((cx-x2)**2 + (cy-y2)**2)**(1/2) #출발점과 원 중심의 거리
+        if distance1 < r and distance2 < r: #출발점과 도착점이 모두 원 안에 존재
+            continue
+        elif distance1 > r and distance2 > r: #출발점과 도착점이 모두 원 밖에 존재
+            continue
+        else: #출발점과 도착점 중 하나가 원 안에 존재
+            answer += 1
+    print(answer)

01-240319/yunjaeeun44/A.py

@@ -0,0 +1,31 @@
+def solution(friends, gifts):
+    givers = {}
+    receivers = {}
+    score = {}
+    answer = {}
+    #givers, receivers
+    for friend in friends:
+        givers[friend] = []
+        receivers[friend] = []
+        answer[friend] = 0
+    for gift in gifts:
+        giver, receiver = gift.split()
+        givers[giver].append(receiver)
+        receivers[receiver].append(giver)
+    #score
+    for friend in friends:
+        score[friend] = len(givers.get(friend))-len(receivers.get(friend))
+    #answer
+    for friend in friends:
+        #두 사람이 선물을 주고받은 기록 체크
+        for other in friends:
+            if other == friend:
+                continue
+            #선물을 주고받은 기록이 서로 같아서 선물 지수 체크
+            if givers[friend].count(other) == givers[other].count(friend):
+                if score[friend] > score[other]:
+                    answer[friend] += 1
+            #선물을 주고받은 기록이 서로 다름
+            elif givers[friend].count(other) > givers[other].count(friend):
+                    answer[friend] += 1
+    return max(answer.values())

01-240319/yunjaeeun44/B.py

@@ -0,0 +1,21 @@
+from collections import Counter
+
+def solution(edges):
+    answer = [0, 0, 0, 0]
+    dotChecks = {}
+    for start, end in edges:
+        if dotChecks.get(start) == None:
+            dotChecks[start] = [0, 0]
+        if dotChecks.get(end) == None:
+            dotChecks[end] = [0, 0]
+        dotChecks[start][0] += 1
+        dotChecks[end][1] += 1
+    for key, check in dotChecks.items():
+        if check[0] >=2 and check[1] == 0: #생성한 정점
+            answer[0] = key
+        elif check[0]==2 and check[1]>=2: #8자 그래프(생성된 정점에서 나온 간선의 도착점일 경우 존재)
+            answer[3] += 1
+        elif check[0]==0:
+            answer[2] += 1
+    answer[1] = dotChecks[answer[0]][0] - answer[2] - answer[3]
+    return answer

01-240319/yunjaeeun44/C.py

@@ -0,0 +1,37 @@
+from itertools import combinations, product
+from bisect import bisect_left
+
+def solution(dice):
+    wins_dict = {}
+    #주사위 조합
+    combsA = list(combinations(range(len(dice)), len(dice)//2))
+    for combA in combsA:
+        combB = []
+        for i in range(len(dice)):
+            if i not in combA:
+                combB.append(i)
+                
+        sumListA = [] #해당 주사위 조합에서 나올 수 있는 값
+        sumListB = []
+        for dice_product in product(range(6), repeat=len(dice)//2): #주사위면 중복 순열
+            sumA = 0
+            sumB = 0
+            for i, j in zip(combA, dice_product):
+                sumA += dice[i][j]
+            for i, j in zip(combB, dice_product):
+                sumB += dice[i][j]
+            sumListA.append(sumA)
+            sumListB.append(sumB)
+        sumListB.sort() 
+        
+        wins = 0
+        for sumA in sumListA:
+            wins += bisect_left(sumListB, sumA)
+        wins_dict[wins] = list(combA)
+    
+    max_key = max(wins_dict.keys())
+    answer = []
+    for x in wins_dict[max_key]:
+        answer.append(x+1)
+    
+    return answer

01-240319/yunjaeeun44/D.py

@@ -0,0 +1,31 @@
+from collections import deque
+
+def check(deck1, deck2, target):
+    for card in deck1:
+        if target - card in deck2:
+            deck1.remove(card)
+            deck2.remove(target-card)
+            return True
+    return False
+    
+
+def solution(coin, cards):
+    answer = 1
+    hands = cards[:len(cards)//3]
+    deck = deque(cards[len(cards) // 3:])
+    draws = []
+    
+    while coin >=0 and deck:
+        draws.append(deck.popleft())
+        draws.append(deck.popleft())
+        
+        if check(hands, hands, len(cards) + 1):
+            pass
+        elif coin >= 1 and check(hands, draws, len(cards) + 1):
+            coin -= 1
+        elif coin >= 2 and check(draws, draws, len(cards) + 1):
+            coin -= 2
+        else:
+            break
+        answer += 1
+    return answer

01-240319/yunjaeeun44/E.py

@@ -0,0 +1,14 @@
+def solution(n, tops):
+    MOD = 10007
+    a = [0] * (n + 1) #오른쪽에 위치한 위 방향 삼각형 포함
+    b = [0] * (n + 1) #오른쪽에 위치한 위 방향 삼각형 미포함
+    a[0] = 0 #위 방향 삼각형 하나만 있을 때
+    b[0] = 1
+    for k in range(1, n + 1): #아래 방향 삼각형 하나씩 덮기
+        if tops[k - 1]:
+            a[k] = (a[k - 1] + b[k - 1]) % MOD
+            b[k] = (2 * a[k - 1] + 3 * b[k - 1]) % MOD
+        else:
+            a[k] = (a[k - 1] + b[k - 1]) % MOD
+            b[k] = (a[k - 1] + 2 * b[k - 1]) % MOD
+    return (a[n] + b[n]) % MOD