Merge branch 'main' into kcm_09_06

Author: bsyzch

.gitignore

@@ -1,2 +1,5 @@
 .idea/
-.DS_Store
+.DS_Store
+codingtest_JavaJobJava.iml
+.idea
+out

cmkim/BaekJoon/백준_1039.py

@@ -0,0 +1,44 @@
+
+from _collections import deque
+from itertools import combinations
+import sys, copy
+
+
+def bfs():
+    c = set()
+    answer = 0
+    qlen = len(q)
+    while qlen:
+        x = q.popleft()
+        l = list(str(x))
+        for i, j in d:
+            s = copy.deepcopy(l)
+            temp_i, temp_j = s[i], s[j]
+            s[i], s[j] = temp_j, temp_i
+            if s[0] == '0':
+                continue
+            nx = int(''.join(s))
+            if nx not in c:
+                answer = max(answer, nx)
+                c.add(nx)
+                q.append(nx)
+        qlen -= 1
+    return answer
+
+
+n, k = map(int, input().split())
+item = [i for i in range(len(str(n)))]
+d = list(combinations(item, 2))
+#print(d)
+q = deque()
+q.append(n)
+
+ans = 0
+while k:
+    ans = bfs()
+    k -= 1
+if not ans:
+    print(-1)
+else:
+    print(ans)
+

cmkim/BaekJoon/백준_1062.py

@@ -0,0 +1,39 @@
+
+from itertools import combinations
+from string import ascii_lowercase
+
+antatica = ['a', 'c', 'i', 'n', 't']
+
+def brute_force(alpha, cnt):
+    if cnt == k:
+        temp = 0
+        for i in range(n):
+            flag = 0
+            for j in range(len(check[i])):
+                if not alphabet[]
+
+n, k = map(int, input().split())
+if k < 5:
+    print(0)
+    return
+
+arr = [list(map(str, input())) for _ in range(n)]
+alphabet = [False] * 26
+for i in range(5):
+    alphabet[ord(antatica[i]) - ord('a')] = True
+print(alphabet)
+#teach = list(combinations(list(ascii_lowercase), k - 5))
+word = []
+for i in range(n):
+    word.append(arr[i][4:-4])
+
+for i in range(n):
+    check = []
+
+    for j in range(len(word[i])):
+        if word[i][j] not in antatica:
+            check.append(word[i][j])
+    check = set(check)
+
+brute_force(0, 0)
+    #for i in range(len(check)):

cmkim/BaekJoon/백준_1072.py

@@ -0,0 +1,24 @@
+def main():
+
+    x, y = map(int, input().split())
+
+    z = int(y * 100 / x)
+
+    if z >= 99:
+        print(-1)
+        return 0
+
+    answer = 1000000000
+    start, end = 1, 1000000000
+    while start <= end:
+        mid = (start + end) // 2
+        nextz = int((y + mid) * 100 / (x + mid))
+        if z < nextz:
+            if mid < answer:
+                answer = mid
+            end = mid - 1
+        else:
+            start = mid + 1
+
+    print(answer)
+main()

cmkim/BaekJoon/백준_10800.py

@@ -0,0 +1,33 @@
+import sys
+
+input = sys.stdin.readline
+n = int(input())
+
+ball = []
+answer = [0] * n
+color = [0] * 200001  # [0 for _ in range(200000)] #
+
+for i in range(n):
+    c, s = map(int, input().split())
+    ball.append([i, c, s])
+
+# print(ball)
+ball.sort(key=lambda x: x[2])  # 사이즈, 컬러 순 오름차순
+# print(ball)
+
+j = 0
+sum = 0
+for i in range(n):
+    a = ball[i]
+    b = ball[j]
+
+    while b[2] < a[2]:
+        sum += b[2]
+        color[b[1]] += b[2]
+        j += 1
+        b = ball[j]
+
+    answer[a[0]] = sum - color[a[1]]
+
+for i in range(n):
+    print(answer[i])

cmkim/BaekJoon/백준_1103.py

@@ -0,0 +1,85 @@
+from _collections import deque
+import sys
+sys.setrecursionlimit(10**6)
+n, m = map(int, input().split())
+
+dx = [-1, 1, 0, 0]
+dy = [0, 0, -1, 1]
+
+arr = [list(map(str, input())) for _ in range(n)]
+dp = [[0] * m for _ in range(n)]
+visited = [[0] * m for _ in range(n)]   #dp 배열추가
+# q = deque()
+# q.append((0, 0, 1))# x, y 좌표와 움직인 횟수
+result = 0         # 가장 큰 값을 저장해줄 변수
+
+def bfs(x, y, count):
+    global result
+    result = max(result, count)
+
+    for i in range(4):
+        nx = x + dx[i] * int(arr[x][y])
+        ny = y + dy[i] * int(arr[x][y])
+
+        if 0 <= nx < n and 0 <= ny < m and arr[nx][ny] != 'H' and dp[nx][ny] < count + 1: #적은 이동횟수는 무시하는 조건 추가
+            if visited[nx][ny]:
+                print(-1)
+                exit()
+            else:
+                dp[nx][ny] = count + 1
+                visited[nx][ny] = 1
+                bfs(nx, ny, count+1)
+                visited[nx][ny] = 0
+
+bfs(0, 0, 0)
+print(result + 1)
+
+# while q:
+#     x, y, count = q.popleft()
+#
+#     if count > n*m: #무한 반복될때 종료조건
+#         print(-1)
+#         quit()
+#     for i in range(4):
+#         nx = x + dx[i] * int(arr[x][y])
+#         ny = y + dy[i] * int(arr[x][y])
+#
+#         if 0 <= nx < n and 0 <= ny < m and arr[nx][ny] != 'H' and visited[nx][ny] < count: #적은 이동횟수는 무시하는 조건 추가
+#             q.append((nx, ny, count+1))
+#             visited[nx][ny] = count
+#
+#
+# for i in range(n):
+#     for j in range(m):
+#         result = max(result, visited[i][j])
+#
+# if result < n*m:
+#     print(result + 1)
+# else:
+#     print(-1)
+
+
+# bfs 함수 따로 뽑아서 하는거랑 메인에서 q 구현해서 하는거랑 대체 무슨 차이?
+# 밑에 1크게 시작하는거랑 무슨차이?
+'''
+def bfs(x, y, count):
+    global result
+    result = max(result, count)
+
+    for i in range(4):
+        nx = x + dx[i] * int(arr[x][y])
+        ny = y + dy[i] * int(arr[x][y])
+
+        if 0 <= nx < n and 0 <= ny < m and arr[nx][ny] != 'H' and dp[nx][ny] < count: #적은 이동횟수는 무시하는 조건 추가
+            if visited[nx][ny]:
+                print(-1)
+                exit()
+            else:
+                dp[nx][ny] = count +1
+                visited[nx][ny] = 1
+                bfs(nx, ny, count+1)
+                visited[nx][ny] = 0
+
+bfs(0, 0, 1)
+print(result)
+'''

cmkim/BaekJoon/백준_1202.py

@@ -0,0 +1,40 @@
+import heapq
+import sys
+input = sys.stdin.readline
+n, k = map(int, input().split())
+
+jewel = []
+bags = []
+
+for i in range(n):
+    w, v = map(int, input().split())
+    heapq.heappush(jewel, (w, v))
+
+for i in range(k):
+    heapq.heappush(bags, int(input()))
+
+result = 0
+selected = []
+for _ in range(k):
+    bags_weight = heapq.heappop(bags)
+
+    while jewel and bags_weight >= jewel[0][0]:
+        tmp = heapq.heappop(jewel)
+        w, v = tmp[0], tmp[1]
+        heapq.heappush(selected, -v)
+
+    if selected:
+        result -= heapq.heappop(selected)
+
+print(result)
+'''
+4 4
+1 100
+2 200
+13 300
+10 500
+14
+3
+12
+1
+'''

cmkim/BaekJoon/백준_1260.py

@@ -0,0 +1,42 @@
+from collections import deque
+def DFS(v, visited):
+
+    visited[v] = 1
+    print(v, end = ' ') # end= ' '  -> 다음 출력값 사이의 간격 조정(줄바꿈도 생략가능)
+
+    for i in range(1, n+1):
+
+        if not visited[i] and arr[v][i] == 1:
+            DFS(i, visited)
+
+def BFS(v, visited):
+    queue = deque([v])
+    visited[v] = 1
+
+    while(queue):
+        v = queue.popleft()  # 시작 기준이 되는 값을 잡고 시작한다.
+        print(v, end=' ')  # end= ' '  -> 다음 출력값 사이의 간격 조정(줄바꿈도 생략가능)
+        for i in range(1, n+1):  # 기준값 주변에 있는 방문하지 않은 값들을 전부 탐색한다.
+            if not visited[i] and arr[v][i] == 1:
+                queue.append(i)
+                visited[i] = 1
+
+
+
+n, m, v = map(int, input().split())
+
+arr = [[0]*(n+1) for _ in range(n+1)]
+visited = [0]*(n+1)
+
+for i in range(m):
+    x, y = map(int, input().split())
+    arr[x][y] = 1
+    arr[y][x] = 1
+
+
+
+
+DFS(v, visited) #사용할 graph, 시작노드, 방문여부
+print('')
+visited = [0]*(n+1)
+BFS(v, visited)

cmkim/BaekJoon/백준_12927.py

@@ -0,0 +1,17 @@
+arr = input()
+n = len(arr)
+light = [-1]
+count = 0
+for i in range(n):
+    if arr[i] == 'Y':
+        light.append(1)
+    else:
+        light.append(-1)
+
+for i in range(1, n+1):
+    if light[i] == 1:
+        for j in range(i, n+1, i):
+            light[j] *= -1
+        count += 1
+
+print(count)

cmkim/BaekJoon/백준_14476.py

@@ -0,0 +1,2 @@
+n = int(input())
+arr = list(map(int, input().split()))