Kcm boj programers (#94)

* 주말코테

* 변경사항

* 찬민 백준, 프로그래머스 숙제

* 찬민 프로그래머스 22주차 숙제

* 찬민 프로그래머스 22주차 숙제

* 네이버웹툰 개발코테

Author: bsyzch

cmkim/2021 네이버웹툰 개발 챌린지/1번문제.py

@@ -0,0 +1,25 @@
+def solution(lottery):
+    answer = -1
+
+    arr = [0] * 1001
+    visited = [0] * 1001
+    sum = 0
+    count = 0
+    for i in range(len(lottery)):
+        if lottery[i][1] == 0 and visited[lottery[i][0]] == 0:
+            arr[lottery[i][0]] += 1
+        else:
+            visited[lottery[i][0]] = 1
+
+    for i in range(1000):
+        if visited[i]:
+            sum += arr[i]
+            count += 1
+    #print(sum, count)
+
+    if sum:
+        answer = (sum+count) // count
+    else:
+        answer = 0
+
+    return answer

cmkim/2021 네이버웹툰 개발 챌린지/2번문제.py

@@ -0,0 +1,31 @@
+from _collections import deque
+
+
+
+dx = [-1, 1, 0, 0] #상하좌우
+dy = [0, 0, -1, 1]
+
+def solution(grid):
+    answer = 0
+    row = len(grid)
+    col = len(grid[0])
+    map = [[1e9] * col for _ in range(row)]
+    map[0][0] = grid[0][0]
+    q = deque()
+    q.append((0, 0))
+
+    while q:
+        x, y = q.popleft()
+        for i in range(4):
+            nx = x + dx[i]
+            ny = y + dy[i]
+            if 0 <= nx < row and 0 <= ny < col:
+                if map[x][y] + grid[nx][ny] < map[nx][ny]:
+                    map[nx][ny] = map[x][y] + grid[nx][ny]
+                    q.append((nx, ny))
+
+
+    answer = map[row-1][col-1]
+
+
+    return answer

cmkim/2021 네이버웹툰 개발 챌린지/3번문제.py

@@ -0,0 +1,18 @@
+from _collections import deque
+import copy
+
+def dfs(a, k):
+    q = deque()
+
+    for i in range(len(a)):
+        if a[i] =
+
+
+    return
+
+def solution(arr, k):
+    answer = -1
+    a = copy.deepcopy(arr)
+    dfs(a, k)
+
+    return answer

cmkim/Programmers/DFS_BFS/네트워크.py

@@ -0,0 +1,23 @@
+from _collections import deque
+
+def solution(n, computers):
+    answer = 0
+    visited = [False for i in range(n)]
+    for i in range(n):
+        if visited[i] == False:
+            bfs(n, computers, i, visited)
+            answer += 1
+
+    return answer
+
+def bfs(n, computers, i, visited):
+    visited[i] = True
+    q = deque()
+    q.append(i)
+    while len(q) > 0:
+        now = q.popleft()
+        visited[now] = True
+        for connect in range(n):
+            if connect != now and computers[now][connect] == 1:
+                if visited[connect] == False:
+                    q.append(connect)

cmkim/Programmers/DP/정수 삼각형.py

@@ -0,0 +1,13 @@
+def solution(triangle):
+
+    for i in range(1, len(triangle)):
+        for j in range(i+1):
+            if j == 0:
+                triangle[i][j] += triangle[i-1][j]
+            elif j == i:
+                triangle[i][j] += triangle[i - 1][j-1]
+            else:
+                triangle[i][j] += max(triangle[i-1][j-1], triangle[i-1][j])
+
+
+    return max(triangle[-1])

cmkim/Programmers/그래프/순위.py

@@ -0,0 +1,4 @@
+def solution(n, results):
+    answer = 0
+
+    return answer

cmkim/Programmers/스택_큐/프린터.py

@@ -0,0 +1,35 @@
+from _collections import deque
+
+
+def solution(priorities, location):
+    answer = 0
+
+    q = deque()
+    result = deque()
+
+    for i in range(len(priorities)):
+        q.append((priorities[i], i))  # 우선 순위랑 인덱스 순서로 넣어준다
+
+    print(q)
+
+    while q:
+        pri, index = q.popleft()
+        flag = 0
+        #print('pri, index = ', pri, index)
+        for i in range(len(q)):
+            if q[i][0] > pri:
+                #print('if')
+                q.append((pri, index))
+                flag = 1
+                break
+        if flag == 0:
+            result.append((pri, index))
+    #print('i = ', i, q)
+
+    #print(result)
+
+    for i in range(len(result)):
+        if result[i][1] == location:
+            answer = i + 1
+
+    return answer

cmkim/Programmers/완전탐색/소수 찾기.py

@@ -0,0 +1,35 @@
+from itertools import permutations
+import math
+
+def solution(numbers):
+    answer = 0
+
+    arr = list(numbers)
+    for i in range(2, len(numbers) + 1):
+        pm = list(permutations(numbers, i))
+        for j in pm:
+            if len(j) <= len(numbers):
+                arr.append(''.join(j))
+
+
+    # arr = list(set(arr))
+    # print(arr)
+
+    arr = list(set([int(x) for x in arr]))
+    #print(arr)
+
+    for i in arr:
+        if check(i):
+            answer += 1
+
+    return answer
+
+def check(n):
+    k = math.sqrt(n)
+    if n < 2:
+        return False
+
+    for i in range(2, int(k)+1):
+        if n % i == 0:
+            return False
+    return True

cmkim/Programmers/정렬/가장 큰 수.py

@@ -1,32 +1,20 @@
 def solution(numbers):
-
     answer = ''
-    count = 0
-    for i in range(len(numbers)):
-        count += len(str(numbers[i])) # i번째 숫자의 자리수를 더해줘서 총 자리수 구하기
-
-
-
-    return answer
 
-9
----------
+    num = list(map(str, numbers))
+    num.sort(key=lambda x: x*3, reverse=True)
 
-7.51
 
-7.53
 
-753
-755
+    for i in range(len(num)):
+        answer += num[i]
 
-7.92
+    zero_flag = 0
+    for i in range(len(answer)):
+        if answer[i] != '0':
+            zero_flag = 1
 
-75     / 10 = 7.55
+    if zero_flag == 0:
+        return '0'
 
-7   7.77
-
-7   7.77
-
-8
-
-9
+    return answer

cmkim/Programmers/해시/전화번호 목록.py

@@ -0,0 +1,17 @@
+def solution(phone_book):
+    answer = True
+    phone_book.sort()
+
+    # for a in range(len(phone_book)-1):
+    #     len_a = len(phone_book[a])
+    #     for b in range(a+1, len(phone_book)):
+    #         if phone_book[a] in phone_book[b][:len_a]:
+    #             answer = False
+
+    for a in range(len(phone_book) - 1):
+        len_a = len(phone_book[a])
+        if phone_book[a] in phone_book[a+1][:len_a]:
+            answer = False
+
+
+    return answer

cmkim/이것이 취업을 위한 코딩 테스트다/국영수_359p.py

@@ -0,0 +1,28 @@
+n = int(input())
+arr = []
+
+for _ in range(n):
+    arr.append(input().split())
+
+arr.sort(key=lambda x: (-int(x[1]), int(x[2]), -int(x[3]), x[0]))
+
+# 정렬된 학생 정보에서 이름만 출력
+for student in arr:
+    print(student[0])
+
+
+'''
+12
+Junkyu 50 60 100
+Sangkeun 80 60 50
+Sunyoung 80 70 100
+Soong 50 60 90
+Haebin 50 60 100
+Kangsoo 60 80 100
+Donghyuk 80 60 100
+Sei 70 70 70
+Wonseob 70 70 90
+Sanghyun 70 70 80
+nsj 80 80 80
+Taewhan 50 60 90
+'''

cmkim/이것이 취업을 위한 코딩 테스트다/안테나_360p.py

@@ -0,0 +1,33 @@
+# n = int(input())
+# a = list(map(int, input().split()))
+# a.sort()
+#
+# print(a[(n - 1) // 2])
+
+n = int(input())
+arr = []
+arr = list(map(int, input().split()))
+arr.sort()
+answer = 0
+for i in range(n):
+    answer += arr[i]
+
+answer /= n
+
+min_v = 1e9
+min_index = 0
+
+
+for i in reversed(range(n)):
+    if min_v >= abs(arr[i]-answer):
+        min_v = min(min_v, abs(arr[i] - answer))
+        min_index = i
+
+
+print(arr[min_index])
+
+'''
+4
+1 5 6 10
+'''
+#1 2 10 11

cmkim/이것이 취업을 위한 코딩 테스트다/카드 정렬하기_363p.py

@@ -0,0 +1,58 @@
+import heapq
+
+n = int(input())
+heap = []
+
+for i in range(n):
+    data = int(input())
+    heapq.heappush(heap, data)
+
+result = 0
+
+while len(heap) != 1:
+    a = heapq.heappop(heap)
+    b = heapq.heappop(heap)
+    sum = a + b
+    result += sum
+    heapq.heappush(heap, sum)
+
+print(result)
+
+# n = int(input())
+#
+# arr = []
+#
+# for i in range(n):
+#     arr.append(int(input()))
+#
+# arr.sort()
+#
+#
+#
+# if n > 1:
+#     answer = arr[0] + arr[1]
+#     for i in range(2, n):
+#         answer += answer
+#         answer += arr[i]
+#         #print('answer = ', answer)
+#
+# if n < 2:
+#     answer = arr[0]
+#
+# print(answer)
+'''
+10
+20 30
+30 60  90
+40 100 190 280
+50 150 340 
+60 210 550
+70 280
+
+10
+20 
+40 
+50 
+
+60 180
+'''