Merge pull request #15 from dsc-sookmyung/yunjaeeun44

[윤재은] 23-24 GDSC algorithm study_4주차

Author: 2093ab

03-240402/yunjaeeun44/A.py

@@ -0,0 +1,12 @@
+n = int(input())
+start = 0
+end = n
+
+while start <= end:
+    mid = (start+end)//2
+    if mid **2 < n:
+        start = mid+1
+    else:
+        end = mid - 1
+        
+print(start)

03-240402/yunjaeeun44/B.py

@@ -0,0 +1,37 @@
+import sys
+input = sys.stdin.readline
+
+n, m = map(int, input().split())  # 건물 n, 도로 m
+INF = int(1e9)
+
+graph = [[INF] * (n + 1) for _ in range(n + 1)]
+for _ in range(m):
+    a, b = map(int, input().split())
+    graph[a][b] = 1
+    graph[b][a] = 1
+
+# 자기 자신은 초기화
+for a in range(1, n + 1):
+    for b in range(1, n + 1):
+        if a == b:
+            graph[a][b] = 0
+
+# 1. 모든 정점에서 모든 정점으로 가는  최소 거리 구하기
+for k in range(1, n + 1):
+    for a in range(1, n + 1):   # 출발 노드
+        for b in range(1, n + 1):   # 도착 노드
+            graph[a][b] = min(graph[a][b], graph[a][k] + graph[k][b])
+
+# 2. 2개의 건물을 선택하여(예상 치킨집) 모든 집을 방문해서 걸리는 거리를 측정 
+min_sum = INF
+result = list()
+for i in range(1, n):  # 건물 2개를 뽑는다.
+    for j in range(2, n + 1):
+        sum_ = 0
+        for k in range(1, n + 1):  # 모든 집을 방문하면서 거리를 측정
+            sum_ += min(graph[k][i], graph[k][j]) * 2  # k -> i, k -> j 중에 짧은 거리 합치기
+        if sum_ < min_sum:
+            min_sum = sum_
+            result = [i, j, sum_]
+
+print(*result) #Unpacking

03-240402/yunjaeeun44/C.py

@@ -0,0 +1,42 @@
+N = int(input())
+paper = list()
+minus, zero, plus = 0, 0, 0
+for _ in range(N):
+    paper.append(list(map(int, input().split())))
+
+def check(row, col, n):
+    global minus, zero, plus
+    curr = paper[row][col]
+    
+    for i in range(row, row+n):
+        for j in range(col, col+n):
+            if paper[i][j] != curr:
+                next_n = n //3
+                check(row, col, next_n)  # 1
+                check(row, col + next_n, next_n)  # 2
+                check(row, col + (2 * next_n), next_n)  # 3
+                check(row + next_n, col, next_n)  # 4
+                check(row + next_n, col + next_n, next_n)  # 5
+                check(row + next_n, col + (2 * next_n), next_n)  # 6
+                check(row + (2 * next_n), col, next_n)  # 7
+                check(row + (2 * next_n), col + next_n, next_n)  # 8
+                check(row + (2 * next_n), col + (2 * next_n), next_n)  # 9
+                return
+    
+    #종이 안의 값이 모두 동일할 때
+    if curr == -1:
+        minus += 1
+    elif curr == 0:
+        zero += 1
+    elif curr == 1:
+        plus += 1
+            
+check(0, 0, N)
+
+print(minus)
+print(zero)
+print(plus)
+
+
+
+    

03-240402/yunjaeeun44/D.py

@@ -0,0 +1,13 @@
+T = int(input())
+for _ in range(T):
+    N = int(input())
+    before = list(input())
+    after = list(input())
+    WtoB, BtoW = 0, 0
+    for i in range(N):
+        if before[i] == 'W' and after[i] == 'B':
+            WtoB += 1
+        elif before[i] == 'B' and after[i] == 'W':
+            BtoW += 1
+    print(max(WtoB, BtoW))
+            

03-240402/yunjaeeun44/E.py

@@ -0,0 +1,17 @@
+import sys
+input = sys.stdin.readline
+
+N = int(input())
+scores = list(map(int, input().split()))
+Q = int(input())
+
+answer = [0] * N
+for i in range(1, N):
+    if scores[i-1] > scores[i]:
+        answer[i] = answer[i-1] + 1
+    else:
+        answer[i] = answer[i-1]
+
+for _ in range(Q):
+    x, y = map(int, input().split())
+    print(answer[y-1]-answer[x-1])

03-240402/yunjaeeun44/F.py

@@ -0,0 +1,26 @@
+import sys
+input = sys.stdin.readline
+
+def solution(A, N, M):
+    left, right = 0, 0
+    answer = 2000000000
+    while right < N:
+        diff = A[right] - A[left]
+        if diff < M:
+            right += 1
+        elif diff > M:
+            answer = min(diff, answer)
+            left += 1
+        else:
+            return M
+    return answer    
+
+N, M = map(int, input().split())
+
+A = [int(input()) for _ in range(N)]
+
+A.sort()
+
+answer = solution(A, N, M)
+
+print(answer)

04-240409/yunjaeeun44/A.py

@@ -0,0 +1,13 @@
+def check(A, B, C, N):
+    for a in range(N):
+        for b in range(N):
+            for c in range(N):
+                if (a*A)+(b*B)+(c*C) == N:
+                    return 1
+    return 0
+    
+A, B, C, N = map(int, input().split())
+print(check(A, B, C, N))
+
+
+        

04-240409/yunjaeeun44/B.py

@@ -0,0 +1,33 @@
+def BT(index, answer):
+    if index == size:
+        print(*answer)
+        exit()
+    
+    num1 = int(x[index]) #한 자리 숫자
+    if not visited[num1]:
+        visited[num1] = True
+        answer.append(num1)
+        BT(index+1, answer)
+        visited[num1] = False
+        answer.pop()
+    
+    if index+1 < size:
+        num2 = int(x[index : index+2])
+        if num2 <= N and not visited[num2]:
+            visited[num2] = True
+            answer.append(num2)
+            BT(index+2, answer)
+            visited[num2] = False
+            answer.pop()
+        
+x = input()
+
+size = len(x)
+if size <= 9:
+    N = size #N이 한자리 숫자
+else:
+    N = 9+(size-9)//2 #N이 두자리 숫자(최대 50)
+
+visited = [0] * (N+1)
+
+BT(0, [])

04-240409/yunjaeeun44/C.py

@@ -0,0 +1,24 @@
+import sys
+input = sys.stdin.readline
+
+def check(t, k):
+    if (t == 1):        #단절점
+        if (len(tree[k]) < 2):
+            return("no")
+        else:
+            return("yes")        
+    if (t == 2):        #단절선
+        return("yes")
+
+N = int(input())
+tree = [[] for _ in range(N+1)]
+bridges = [0]
+for _ in range(N-1): #간선의 정보
+    a, b = map(int, input().split())
+    tree[a].append(b)
+    tree[b].append(a)
+
+q = int(input())
+for _ in range(q): #간선의 정보
+    t, k = map(int, input().split())
+    print(check(t, k))

04-240409/yunjaeeun44/D.py

@@ -0,0 +1,19 @@
+N = int(input())
+arr = list(map(int, input().split()))
+x = int(input())
+
+arr.sort()
+left, right = 0, N-1
+answer = 0
+
+while(left < right):
+    if arr[left] + arr[right] == x:
+        answer += 1
+        left += 1
+        right -= 1
+    elif arr[left] + arr[right] > x:
+        right -= 1
+    elif arr[left] + arr[right] < x:
+        left += 1
+
+print(answer)