codenextdoor

2023 현대모비스 알고리즘 경진대회 예선 def solution(temperature, t1, t2, a, b, onboard): answer = 0 dp = [[float("inf")] * 51 for _ in range(len(onboard))] adj_t1 = t1 + 10 adj_t2 = t2 + 10 adj_tmp = temperature + 10 def_min_tmp = 0 def_max_tmp = 51 dp[0][adj_tmp] = 0 # minute for m in range(1, len(onboard)): isOnboard = onboard[m] min_tmp = 0 max_tmp = 0 if isOnboard: min_tmp = adj_t1 max_tmp = adj_t2 + 1 els..

import heapq def solution(operations): min_heap, max_heap = [], [] for oper in operations: o = oper.split(" ") if o[0] == "I": heapq.heappush(min_heap, int(o[1])) heapq.heappush(max_heap, -int(o[1])) elif o[0] == "D": if not min_heap and not max_heap: continue if o[1] == "-1": max_heap.remove(-heapq.heappop(min_heap)) elif o[1] == "1": min_heap.remove(-heapq.heappop(max_heap)) answer = [] if min..

2024 KAKAO WINTER INTERNSHIP combi = [] perm = [] def solution(dice): leng = len(dice) generate(leng, [], 0, 0) permu(leng / 2, [], 0) max_winrate = 0 max_dice = [] count = 0 for arr in combi: b_arr = [] for i in range(leng): if i not in arr: b_arr.append(i) red = {} blue = {} for p in perm: a_val = 0 for i in range(len(arr)): a_val += dice[arr[i]][p[i]] red[a_val] = red.get(a_val, 0) + 1 b_val ..

def solution(n, k): answer = 0 for str in convert_notation(n, k).split("0"): if len(str) > 0 and int(str) > 1 and check_prime(int(str)): answer += 1 return answer def convert_notation(n, base): T = "0123456789ABCDEF" q, r = divmod(n, base) return convert_notation(q, base) + T[r] if q else T[r] def check_prime(num): valid = True for i in range(2, int(num ** 0.5) + 1): if (num % i == 0): valid = F..

def solution(n, tops): answer = 0 div = 10007 # 우하단 마름모를 제외한 경우의 수 배열 a = [0] * (n + 1) # 우하단 마름모만을 포함하는 경우의 수 배열 b = [0] * (n + 1) a[0] = 1 for i in range(0, n): # 현재 순회 중 top 존재 시 발생 경우의 수 확인 if (tops[i] == 1): a[i + 1] = a[i] * 3 + b[i] * 2 else: a[i + 1] = a[i] * 2 + b[i] * 1 # 현재 정삼각형에서 우하단 마름모인 경우는 앞선 경우의 수와 무관 b[i + 1] = a[i] + b[i] a[i + 1] = a[i + 1] % div; b[i + 1] = b[i + 1] % div; re..

def solution(h1, m1, s1, h2, m2, s2): answer = 0 s_total = getTotalTime(h1, m1, s1) e_total = getTotalTime(h2, m2, s2) if (s_total == 0 or s_total == 12 * 3600): answer += 1 for time in range(s_total, e_total): # 현재 위치 s_sec = time * 6 % 360 s_min = time * (6 / 60) % 360 s_hour = time * (30 / 3600) % 360 # 1초 뒤 위치 e_sec = (time + 1) * 6 % 360 e_min = (time + 1) * (6 / 60) % 360 e_hour = (time + ..