풀캠정글러

m = int(input()) k = 0 leng = 3 while leng < m : k = k + 1 leng = 2 * leng + 3 + k def DAC(x, l, n) : if x == 0 : if n == 1 : return 'm' else : return 'o' l = (l - 3 - x) // 2 x = x - 1 if n l + x + 4 : return DAC(x, l, n - l - x - 4) else : return 'o' print(DAC(k, leng, m)) n의 range가 10억이므로 순열을 직접 만들어서는 메모리 초과가 나올 것이다. 순열을 직접 만들지 않고 길이와 구성만 다루는 접근이 필요하다. S(k)는 세 부분으로 나눌 수 있다. 왼쪽 S(k-1), 가운데 moo..

import sys input = sys.stdin.readline from decimal import * getcontext().prec = 27 getcontext().rounding = ROUND_HALF_UP a, b, c = map(Decimal,map(int,input().split())) pi = Decimal('3.141592653589793238462643383') def sin(x) : x = x % (2 * pi) getcontext().prec += 2 i, lasts, s, fact, num, sign = 1, 0, x, 1, x, 1 while s != lasts: lasts = s i += 2 fact *= i * (i-1) num *= x * x sign *= -1 s += ..

def euc(a, b) : x0, x1, y0, y1 = 1, 0, 0, 1 A = a # a = bq0 + r1 # b = r1q1 + r2 # r1 = r2q2 + r3 # ... while b != 0 : q = a // b r = a % b a = b b = r x0, x1 = x1, x0 - q*x1 y0, y1 = y1, y0 - q*y1 if a != 1 or y0 > 10**9 : return 'IMPOSSIBLE' if y0 < 0 : y0 = y0 + A return y0 n = int(input()) for i in range(n) : k, c = map(int, input().split()) if c == 1 : if k < 10**9 : print(k + 1) else : pri..

def msort(l, start, end) : global count if start < end : center = (start + end) // 2 msort(l, start, center) msort(l, center + 1, end) pl, pr = start, center + 1 rec = [] while pl

n = int(input()) bilist = [] while n != 0 : bilist.append(n%2) n = n//2 def mult(A, B) : C = [[0 for i in range(2)] for j in range(2)] for i in range(2) : for j in range(2) : sum = 0 for x in range(2) : sum = sum + A[i][x] * B[x][j] C[i][j] = sum % 1000000 return C X = [[1, 1], [1, 0]] powerlist = [] for i in range(len(bilist)) : powerlist.append(X) X = mult(X, X) Xn = [[1,0],[0,1]] for i in ran..

n = int(input()) l = list(map(int, input().split())) l.append(0) l.append(0) for i in range(n) : l[n-i] = l[n-i-1] l[0] = 0 stack = [[0, 0]] maxarea = 0 for i in range(1, n+2) : h = l[i] while stack[-1][1] > h : sh = stack[-1][1] del stack[-1] while stack[-1][1] == sh : del stack[-1] area = (i - stack[-1][0] - 1) * sh maxarea = max(maxarea, area) stack.append([i, h]) print(maxarea) x축이 날짜, y축이 임..

import sys input = sys.stdin.readline import heapq testcase = int(input()) for j in range(testcase) : n = int(input()) l = [] if n % 10 == 0 : for i in range(n // 10) : l = l + list(map(int, input().split())) else : for i in range(n // 10 + 1) : l = l + list(map(int, input().split())) under = [] over = [] ans = [] for i in range(n) : x = l[i] if len(under) == len(over) : heapq.heappush(under, -x..

import sys input = sys.stdin.readline heap = [''] n = int(input()) for i in range(n) : e = int(input()) if e == 0 : if heap == [''] : print(0) else : e = heap[-1] heap[1], heap[-1] = heap[-1], heap[1] print(heap[-1]) del heap[-1] index = 1 while index * 2 1 : if abs(e)

import sys input = sys.stdin.readline heap = [''] n = int(input()) for i in range(n) : e = int(input()) if e == 0 : if heap == [''] : print(0) else : e = heap[-1] heap[1], heap[-1] = heap[-1], heap[1] print(heap[-1]) del heap[-1] index = 1 while index * 2 < len(heap) : a = index * 2 if len(heap) == index * 2 + 1 : next = a else : b = a + 1 if heap[a] heap[next] : heap[index], heap[next] = heap[n..

from bisect import bisect_left n = int(input()) l = list(map(int,input().split())) order = [0 for i in range(n)] order[0] = 1 table = [l[0]] for i in range(1, n) : if table[-1] < l[i] : table.append(l[i]) order[i] = len(table) else : order[i] = bisect_left(table, l[i]) + 1 table[order[i] - 1] = l[i] m = max(order) print(m) lis = [] for i in range(n) : if order[n-1-i] == m : lis.append(l[n-1-i]) ..