2week

Author: yunjaeeun44

02-240326/yunjaeeun44/A.py

@@ -0,0 +1,7 @@
+n, m = map(int, input().split())
+answer = 1
+for i in range(m):
+    answer *= n-i
+for i in range(1, m+1):
+    answer = answer // i
+print(answer)

02-240326/yunjaeeun44/B.py

@@ -0,0 +1,24 @@
+N = int(input())
+A = list(map(int, input().split()))
+add, sub, mul, div = map(int, input().split());
+max_result = - int(1e9)
+min_result = int(1e9)
+
+def dfs(add, sub, mul, div, sum, idx):
+    global max_result, min_result
+    if idx == N:
+        max_result = max(max_result, sum)
+        min_result = min(min_result, sum)
+        return
+    if add:
+        dfs(add-1, sub, mul, div, sum + A[idx], idx + 1)
+    if sub:
+        dfs(add, sub-1, mul, div, sum - A[idx], idx + 1)
+    if mul:
+        dfs(add, sub, mul-1, div, sum * A[idx], idx + 1)
+    if div:
+        dfs(add, sub, mul, div-1, int(sum / A[idx]), idx + 1)
+        
+dfs(add, sub, mul, div, A[0], 1)
+print(max_result)
+print(min_result)

02-240326/yunjaeeun44/C.py

@@ -0,0 +1,68 @@
+import sys
+from collections import deque
+
+def fire_move():
+    size = len(fires)
+    while size:
+        x, y = fires.popleft()
+        for ddx, ddy in zip(dx, dy):
+            nx = x + ddx
+            ny = y + ddy
+            if 0 <= nx < w and 0 <= ny < h and building[ny][nx] == '.':
+                fires.append([nx, ny])
+                building[ny][nx] = '*'
+        size -= 1
+
+def BFS():
+    while sanggeuns:
+        fire_move()
+        size = len(sanggeuns)
+        while size:
+            x, y, sec = sanggeuns.popleft()
+            for ddx, ddy in zip(dx, dy):
+                nx = x + ddx
+                ny = y + ddy
+                if 0 <= nx < w and 0 <= ny < h:
+                    if building[ny][nx] == '.' and visit[ny][nx]==0:
+                        sanggeuns.append([nx, ny, sec+1])
+                        visit[ny][nx] = 1
+                else: 
+                    return sec + 1
+            size -= 1
+    return 0
+            
+
+
+input = sys.stdin.readline
+
+dx = [0,1,-1,0]
+dy = [1,0,0,-1]
+
+building = [] #불 실시간 반영
+fires = deque(list()) #다음에 번질 불의 위치들을 담는 큐
+sanggeuns = deque(list()) #[상근이의 위치, 탈출한 시간]을 담는 큐
+
+T = int(input())
+for _ in range(T):
+    w, h = map(int, input().split())
+    building.clear()
+    fires.clear()
+    sanggeuns.clear()
+    visit = [[0]*w for _ in range(h)]
+
+    for y in range(h):
+        building.append(list(input()))
+        for x in range(w):
+            if building[y][x] == '@':
+                sanggeuns.append([x, y, 0])
+                visit[y][x] = 1
+                building[y][x] == '.'
+            if building[y][x] == '*':
+                fires.append([x, y])
+
+    result = BFS()
+    if result == 0:
+        print("IMPOSSIBLE")
+    else:
+        print(result)
+    

02-240326/yunjaeeun44/D.py

@@ -0,0 +1,31 @@
+import sys
+#input = sys.stdin.readline
+
+S = input()
+duck = ['q','u','a','c','k']
+ducks = [[]]
+valid = True
+
+def main():
+    for sound in S:
+        put = False
+        idx = duck.index(sound)
+        for i in ducks:
+            if len(i)%5 == idx:
+                i.append(sound)
+                put = True
+                break
+        if put == False and idx == 0:
+            ducks.append(['q'])
+            put = True
+        elif put == False:
+            print(-1)
+            return 0
+    
+    for i in ducks:
+        if len(i)%5 != 0:
+            print(-1)
+            return 0
+    print(len(ducks))
+
+main()

02-240326/yunjaeeun44/E.py

@@ -0,0 +1,18 @@
+N, K = map(int, input().split())
+nums = list(map(int, input().split()))
+left, right, answer = 0, 0, 0
+dic = {}
+
+while right < N:
+    if not dic.get(nums[right]):
+        dic[nums[right]] = 1
+        right += 1
+    elif dic.get(nums[right]) < K:
+        dic[nums[right]] = dic[nums[right]] + 1
+        right += 1
+    else:
+        dic[nums[left]] = dic[nums[left]] - 1
+        left += 1
+    answer = max(answer, right - left)
+print(answer)
+        

02-240326/yunjaeeun44/F.py

@@ -0,0 +1,18 @@
+import sys
+input = sys.stdin.readline
+
+def check(phone_nums, N):
+    for i in range(N-1):
+        if phone_nums[i] == phone_nums[i+1][:len(phone_nums[i])]:
+            print("NO")
+            return 0
+    print("YES")
+
+T = int(input())
+for _ in range(T):
+    N = int(input())
+    phone_nums = []
+    for i in range(N):
+        phone_nums.append(input().rstrip())
+    phone_nums.sort()
+    check(phone_nums, N)