takeU

import sys input = sys.stdin.readline while True: try: x, n = int(input().rstrip()) * 10000000, int(input().rstrip()) li = sorted([int(input().rstrip()) for _ in range(n)]) left, right, check = 0, n - 1, 1 while left < right: s = li[left] + li[right] if s == x: print('yes', li[left], li[right]) check = 0 break elif s < x: left += 1 else: right -= 1 if check: print('danger') except: break 투포인터

x, y = map(int, input().split()) rate = (y * 100) // x left, right = 1, x ans = -1 while left

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

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) return tree[index] def interval_sum(start, end, index, left, right): if lef..

def heap_sort(li, n): global count build_min_heap(li, n); for i in range(n, 1, -1): li[1], li[i] = li[i], li[1] count += 1 if count == K: print(*li[1:]) exit() heapify(li, 1, i - 1); def build_min_heap(li, n): for i in range(n // 2, 0, -1): heapify(li, i, n) def heapify(li, k, n): global count left, right = 2 * k, 2 * k + 1 if right

def heap_sort(li, n): global count build_min_heap(li, n); for i in range(n, 1, -1): li[1], li[i] = li[i], li[1] count += 1 if count == K: print(li[i], li[1]) exit() heapify(li, 1, i - 1); def build_min_heap(li, n): for i in range(n // 2, 0, -1): heapify(li, i, n) def heapify(li, k, n): global count left, right = 2 * k, 2 * k + 1 if right