삽질 중에 최고의 삽질 개발자

def solution(d, budget): sort_d = sorted(d) out_budget = sum(d) - budget check_budget = 0 result = 0 if out_budget

def solution(s): s_arr = s.split(" ") result = "" for count in range(len(s_arr)): for idx in range(len(s_arr[count])): if idx % 2 == 0: result += s_arr[count][idx].upper() else: result += s_arr[count][idx].lower() result += "" if count == len(s_arr)-1 else " " return result

def solution(arr): check_number = -1 result = [] for number in arr: if check_number == -1: check_number = number result.append(number) if check_number != number: check_number = number result.append(number) return result def solution(arr): check_number = 0 result = [] for idx in range(len(arr)): if idx == 0: check_number = arr[idx] result.append(arr[idx]) else: if check_number != arr[idx]: check_..

a, b = map(int, input().strip().split(' ')) for idx in range(b): print('*'* a)

def solution(arr1, arr2): result = [] for idx in range(len(arr1)): check_arr = [] for j in range(len(arr1[idx])): check_arr.append(arr1[idx][j] + arr2[idx][j]) result.append(check_arr) return result

def solution(s): try: int(s) return True if len(s) == 6 or len(s) == 4 else False except Exception as err: return False

def solution(price, money, count): result = sum([ price*(idx+1) for idx in range(count) ]) - money return 0 if result

def solution(s): return ''.join(sorted([ s[idx] for idx in range(len(s))], reverse=True)) [26일차][프로그래머스][12922]

def solution(left, right): result = 0 for idx in range(left, right+1): count = 0 for number in range(idx): if idx % int(number+1) == 0: count += 1 if count % 2 == 0: result += idx else: result -= idx return result [26일차][프로그래머스][12922]

def solution(a, b): return sum([ a[idx] * b[idx] for idx in range(len(a))])