takeU

def solution(stones, k): left, right = 1, 200000000 while left = k: right = mid - 1 else: left = mid + 1 return left 이분탐색

def rotate(board): board = zip(*board[::-1]) return [list(b) for b in board] def solution(key, lock): n, m = len(key), len(lock) zero = sum(lock, []).count(0) lock = [[0] * 3 * m for _ in range(m)] +\ [[0] * m + lock[i] + [0] * m for i in range(m)] +\ [[0] * 3 * m for _ in range(m)] for _ in range(4): key = rotate(key) for i in range(3 * m - n): for j in range(3 * m - n): temp, count = 0, 0 for ..

x, k = map(int, input().split()) bx, bk = list('0' * 100 + bin(x)[2:]), bin(k)[2:] ans = '' n, m = len(bx) - 1, len(bk) - 1 while m >= 0: if bx[n] == '0': ans = bk[m] + ans m -= 1 else: ans = '0' + ans n -= 1 print(int(ans, 2)) 비트연산문젠데 다르게 풀었음..

import sys input = sys.stdin.readline n, m = map(int, input().split()) li = [int(input()) for _ in range(n)] left = 1 right = ans = max(li) * m while left = m: right = mid - 1 ans = min(ans, mid) else: left = mid + 1 print(ans) 이분탐색

import sys input = sys.stdin.readline from math import ceil n, m = map(int, input().split()) li = [int(input()) for _ in range(m)] left = 1 right = ans = max(li) while left

def solution(s): ans = 10000 for i in range(1, len(s) // 2 + 1): temp = '' li = [s[j:j + i] for j in range(0, len(s), i)] prev, count, temp = li[0], 1, '' for l in li[1:]: if prev == l: count += 1 else: temp += str(count) + prev if count > 1 else prev count = 1 prev = l temp += str(count) + prev if count > 1 else prev ans = min(ans, len(temp)) return ans if len(s) != 1 else 1 문자열

def solution(n, s, a, b, fares): INF = int(1e9) graph = [[0 if i == j else INF for i in range(n + 1)] for j in range(n + 1)] for f in fares: x, y, z = f graph[x][y] = graph[y][x] = z for k in range(1, n + 1): for x in range(1, n + 1): for y in range(1, n + 1): graph[x][y] = min(graph[x][y], graph[x][k] + graph[k][y]) ans = graph[s][a] + graph[s][b] for i in range(1, n + 1): ans = min(ans, graph[..

import sys input = sys.stdin.readline def init(start, end, index): if start == end: tree[index] = li[start] return tree[index] mid = (start + end) // 2 tree[index] = init(start, mid, index * 2) + init(mid + 1, end, index * 2 + 1) return tree[index] def interval_sum(start, end, index, left, right): if left > end or right < start: return 0 if left = end: return tree[index] mid = (start + end) // 2..

import sys input = sys.stdin.readline n, m = map(int, input().split()) li = [int(input()) for _ in range(n)] tree = [[1000000000, 1] for _ in range(4 * n)] def init(start, end, index): if start == end: tree[index] = [li[start], li[start]] return tree[index] mid = (start + end) // 2 l, r = init(start, mid, index * 2), init(mid + 1, end, index * 2 + 1) tree[index] = [min(l[0], r[0]), max(l[1], r[1..

import sys input = sys.stdin.readline n, m, k = map(int, input().split()) li = [int(input()) for _ in range(n)] tree = [0] * 4 * n def init(start, end, index): if start == end: tree[index] = li[start] return tree[index] mid = (start + end) // 2 tree[index] = (init(start, mid, index * 2) * init(mid + 1, end, index * 2 + 1)) % 1000000007 return tree[index] def interval_prod(start, end, index, left..