takeU

import sys import heapq t = int(sys.stdin.readline()) for _ in range(t): n = int(sys.stdin.readline()) min_h = [] max_h = [] check = [0] * n for i in range(n): command = sys.stdin.readline().split() if command[0] == 'I': heapq.heappush(min_h, (int(command[1]), i)) heapq.heappush(max_h, (-int(command[1]), i)) check[i] = 1 else: if command[1] == '1': while max_h and not check[max_h[0][1]]: heapq.h..

from collections import deque n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(m)] check = [[0] * n for _ in range(m)] dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] q = deque() ans = 0 for i in range(m): for j in range(n): if board[i][j] == 1: q.append([i, j, 0]) while q: x, y, count = q.popleft() ans = max(ans, count) for i in range(4): nx, ny = x + dx[i], y + dy..

n, k = map(int, input().split()) li = [int(input()) for _ in range(n)] left, right = 1, max(li) while right >= left: mid = (left + right) // 2 temp = sum(list(map(lambda x: x // mid, li))) if temp >= k: left = mid + 1 else: right = mid - 1 print(right) 이분탐색

n = int(input()) li = list(map(int, input().split())) re_li = li[:][::-1] inc_dp = [1] * n dec_dp = [1] * n for i in range(1, n): inc_dp[i] = max([0] + [inc_dp[j] for j in range(i) if li[j] < li[i]]) + 1 dec_dp[i] = max([0] + [dec_dp[j] for j in range(i) if re_li[j] < re_li[i]]) + 1 print(max([inc_dp[i] + dec_dp[::-1][i] for i in range(n)]) - 1) dp, LIS

n = int(input()) li = list(map(int, input().split())) dp = [[x for x in li] for _ in range(2)] for i in range(1, n): dp[0][i] = max(dp[0][i - 1] + li[i], dp[0][i]) dp[1][i] = max(dp[0][i - 1], dp[1][i - 1] + li[i]) print(max(max(dp[0]), max(dp[1]))) dp

n = int(input()) exp = input() num, ope = [], [] res = -2 ** 31 start = 0 for i, e in enumerate(exp): if e in ['+', '-', '*']: num.append(exp[start:i]) ope.append(exp[i]) start = i + 1 if i == len(exp) - 1: num.append(exp[start:]) def bf(num, ope, check): global res s = num[0] for i in range(len(ope)): s = str(eval(s + ope[i] + num[i + 1])) res = max(res, int(s)) for i in range(len(ope)): if che..

from math import factorial as fac n, k = map(int, input().split()) dp = [n] + [0] * k for i in range(1, k + 1): cur = (n + 1) ** (i + 1) - 1 for j in range(i + 1, 1, -1): cur -= dp[i + 1 - j] * fac(i + 1) // fac(i + 1 - j) // fac(j) dp[i] = cur // (i + 1) print(dp[-1] % 1000000007) dp 자연수의 거듭제곱합 일반항 계산

k = int(input()) n = int(input()) dp = [set() for _ in range(9)] for i in range(1, 9): dp[i].add(k * int('1' * i)) for j in range(1, i): for x in dp[j]: for y in dp[i - j]: dp[i].add(x * y) dp[i].add(x + y) dp[i].add(abs(x - y)) if y != 0: dp[i].add(x // y) for _ in range(n): num = int(input()) for i in range(1, 9): if num in dp[i]: print(i) break if i == 8: print("NO") dp

from itertools import combinations, chain word = input() arr = [] res = set() for i, w in enumerate(word): if w == '(': arr.append([i, 0]) elif w == ')': j = -1 while arr[j][1] != 0: j -= 1 arr[j][1] = i for i in range(1, len(arr) + 1): com = list(combinations(arr, i)) for c in com: c = list(chain(*c)) temp = '' for j, w in enumerate(word): if j not in c: temp += w res.add(temp) res = list(res) ..