Hikenny25

def who_is_winner(f, r): x = card[f] y = card[r] if x == 1: if y == 1 or y == 3: return [f] else: return [r] elif x == 2: if y == 2 or y == 1: return [f] else: return [r] else: if y == 3 or y == 2: return [f] else: return [r] def divide(arr): if len(arr) == 1: return arr i = 1 j = len(arr) mid = (i+j) // 2 front = arr[:mid] rear = arr[mid:] front = divide(front) rear = divide(rear) return who_is..

def line_to_line_distance(start, end): return abs(start_column[start]-start_column[end]) - 1 array_size = 100 repeat_number = 10 ans = list() for _ in range(repeat_number): _ = input() ladder = [list(map(int, input().split())) for _ in range(array_size)] start_column = list() for i in range(array_size): if ladder[0][i] == 1: start_column.append(i) distance = list() for i in range(len(start_colum..

array_size = 100 ans = list() for _ in range(10): _ = int(input()) ladder = [list(map(int, input().split())) for _ in range(array_size)] start = ladder[-1].index(2) line_number = list() for i in range(array_size): if ladder[0][i] == 1: line_number.append(i) line_cnt = line_number.index(start) r, c = array_size - 1, start # row, column for i in range(array_size - 1): r -= 1 if c > 0 and ladder[r]..

array_size = 100 ans = list() for _ in range(10): _ = int(input()) data = [list(map(int, input().split())) for _ in range(array_size)] record_list = list() vsum_cross1 = 0 vsum_cross2 = 0 for i in range(array_size): vsum_row = 0 vsum_col = 0 vsum_cross1 += data[i][i] vsum_cross2 += data[i][array_size - 1 - i] for j in range(array_size): vsum_row += data[i][j] vsum_col += data[j][i] record_list.a..

def max_valueandindex(): vmax, vidx = 0, 0 for i in range(100): if height[i] > vmax: vmax = height[i] vidx = i return vmax, vidx def min_valueandindex(): vmin, vidx = 101, 0 for i in range(100): if height[i] < vmin: vmin = height[i] vidx = i return vmin, vidx def is_flatten(): subtract = max(height) - min(height) if subtract

def how_many_light(idx): height_max = max(height[idx-2], height[idx-1], height[idx+1], height[idx+2]) if height[idx] - height_max

t = int(input()) ans = list() for _ in range(t): _ = int(input()) score = list(map(int, input().split())) max_emergence = [0 for i in range(0, 101)] for i in score: max_emergence[i] += 1 vmax = -1 temp_ans = 0 for i in range(101): if max_emergence[i] >= vmax: vmax = max_emergence[i] temp_ans = i ans.append(temp_ans) for i in range(t): print(f"#{i+1} {ans[i]}") 코스 보니까 파이썬 버전이 있고 일반 버전이 있던데 거기서 주는..

def DFS(start): matrix[start[0]][start[1]] = 9 dx = [0, 0, 1, -1] dy = [1, -1, 0, 0] for i in range(4): x = start[0] + dx[i] y = start[1] + dy[i] if 0

def is_operator(x): if x == '+' or x == '-' or x == '*' or x == '/': return True else: return False def calculation(v1, v2, opt): if opt == '+': return v1 + v2 elif opt == '-': return v2 - v1 elif opt == '*': return v1 * v2 else: return v2 / v1 t = int(input()) ans = list() for _ in range(t): data = list(input().split()) data.pop() # . 삭제 stack = list() for i in data: if not is_operator(i): stac..

https://www.acmicpc.net/problem/1107 1107번: 리모컨 첫째 줄에 수빈이가 이동하려고 하는 채널 N (0 ≤ N ≤ 500,000)이 주어진다. 둘째 줄에는 고장난 버튼의 개수 M (0 ≤ M ≤ 10)이 주어진다. 고장난 버튼이 있는 경우에는 셋째 줄에는 고장난 버튼이 www.acmicpc.net - Brute Force n = int(input()) m = int(input()) if m != 0: breakdown_list = list(input().split()) else: breakdown_list = list() answer_list = [abs(n-100)] channel_list = [i for i in range(1000000)] for i in channe..