takeU

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

def ccw(x1, y1, x2, y2, x3, y3): c = (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1) return c > 0 def convex_hull(positions): convex = [] for p3 in positions: while len(convex) >= 2: p1, p2 = convex[-2], convex[-1] if ccw(*p1, *p2, *p3): break convex.pop() convex.append(p3) return len(convex) n = int(input()) positions = sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x: (x[..

from math import factorial n = int(input()) board = [list(map(int, input().split())) for _ in range(5)] print(factorial(2 * n) // (factorial(n) ** 2) % 1000000007, n ** 2)

from math import factorial n = int(input()) board = [list(map(int, input().split())) for _ in range(5)] print(factorial(2 * n) // (factorial(n) ** 2), n ** 2) 수학

n = int(input()) x, y = 1, 1 for _ in range(n-2): y, x = (x + y) % 1000000007, y print(y, n - 2)

n = int(input()) ans = [0, 1] dp_li = [0, 1, 1] def recur(n): global ans if n < 3: ans[0] += 1 return 1 else: return recur(n - 1) + recur(n - 2) def dp(n): global ans, dp_li if n < 3: return dp_li[n] for i in range(3, n): ans[1] += 1 dp_li.append(dp_li[i - 1] + dp_li[i - 2]) return dp_li[-1] recur(n) dp(n) print(*ans) pypy제출코드 dp