코딩(89)
-
백준 [ALGORITHM] - ROT13 (4446)
while True: vowel = ['a', 'i', 'y', 'e', 'o', 'u'] letters = ['b', 'k', 'x', 'z', 'n', 'h', 'd', 'c', 'w', 'g', 'p', 'v', 'j', 'q', 't', 's', 'r', 'l', 'm', 'f'] result = [] try: lst = list(input()) for i in range(len(lst)): char = lst[i] if char.lower() in vowel: if char.isupper(): temp = vowel.index(char.lower())..
2024.09.09 -
백준[ALGORITHM] - 럭비 클럽 (2083)
lst = dict()while True: name, age, weight = map(str,input().split()) age = int(age) weight = int(weight) if name == '#': break if age >= 18 or weight >= 80: lst[name] = 'Senior' else: lst[name] = 'Junior'for key in lst.keys(): print(key, lst[key])
2024.08.04 -
백준[ALGORITHM] - 좌표 정렬하기 (11650)
n = int(input())temp = {}for _ in range(n): x, y = map(int, input().split()) if x not in temp: temp[x] = [y] else: temp[x].append(y) for key in temp: temp[key].sort()sorted_temp = {k: temp[k] for k in sorted(temp)}for key, value in sorted_temp.items(): for i in range(len(value)): print(key, value[i])
2024.07.18 -
백준 [ALGORITHM] - 블랙잭 (2798)
n, m = map(int, input().split())maximum = 0dack = list(map(int,input().split()))for i in range(n-2): for j in range(i+1, n-1): for k in range(j+1, n): if (dack[i] + dack[j] + dack[k]
2024.07.04 -
백준 [ALGORITHM] - 세로 읽기 (10798)
lst = []size = 0for i in range(5): temp_input = input() lst.append(temp_input) size_temp = len(temp_input) if size_temp >= size: size = size_temp else: passtry: for i in range(size): for j in range(5): if i
2024.07.02 -
백준 [ALGORITHM] - 수 찾기 (1920)
def bin_search(array, target, start, end): while start target: end = mid - 1 else: start = mid + 1 return Falsen = int(input())arr = list(map(int, input().split()))m = int(input())targets = list(map(int, input().split()))sorted_arr = sorted(arr)for target in targets: if bin_search(sorted_arr, target, 0, len(sorted_arr) - 1): print(1) else: ..
2024.06.13