takeU

n = int(input()) li = [False] * 2 + [True] * (n - 1) left, right = 2, 2 acc = left ans = 0 for i in range(2, n + 1): for j in range(2 * i, n + 1, i): if li[j]: li[j] = False def find_next(num): while num < n: num += 1 if li[num]: return num return False while left

n, m = map(int, input().split()) li = list(map(int, input().split())) left, right = 0, 0 acc = li[left] ans = n flag = 0 while left = m: flag = 1 ans = min(ans, right - left + 1) acc -= li[left] left += 1 else: right += 1 if right < n: acc += li[right] print(ans if flag else 0) 투포인터

n = int(input()) li = sorted(list(map(int, input().split()))) left, right = 0, n - 1 prev = [li[0] + li[n - 1], [li[0], li[n - 1]]] while left < right: cur = li[left] + li[right] if cur == 0: prev[1] = [li[left], li[right]] break if abs(cur) < abs(prev[0]): prev = [cur, [li[left], li[right]]] if cur < 0: left += 1 else: right -= 1 print(*prev[1]) 투포인터

import sys input = sys.stdin.readline n, k = map(int, input().split()) student = [0] * n num = [0] * 21 count = 0 for i in range(n): student[i] = len(input().strip()) if i > k: num[student[i - k - 1]] -= 1 count += num[student[i]] num[student[i]] += 1 print(count) 슬라이딩 윈도우

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

내 풀이 n = int(input()) li = list(map(int, input().split())) check = [0] * (2 ** n - 1) ans = [] for _ in range(n): temp = [] flag = True for i, l in enumerate(li): if flag and check[i] == 0: check[i] = 1 temp.append(l) flag = False elif not flag and check[i] == 0: flag = True ans.append(temp) for a in ans[::-1]: print(*a) 다른 사람의 풀이 import sys input = sys.stdin.readline K = int(input()) _input = l..

n = int(input()) mat = [] check = [] ans = [0, [0, 0]] direction = [[0, 1], [1, 1], [1, 0], [1, -1], [0, -1], [-1, -1], [-1, 0], [-1, 1]] flag = 0 for i in range(n): li = list(input()) for j in range(n): if li[j] == &#39;.&#39;: check.append([i, j]) mat.append(li) for c in check: x, y = c count = 0 for d in direction: cur = 0 nx, ny = x, y while check: nx += d[0] ny += d[1] if not 0

from collections import deque n, m = map(int, input().split()) tree = [[0] * (n + 1) for _ in range(n + 1)] for _ in range(n - 1): x, y, d = map(int, input().split()) tree[x][y] = d tree[y][x] = d def bfs(start, end): q = deque([[start, 0]]) check = [0] * (n + 1) while q: s, d = q.popleft() if s == end: return d for i in range(1, n + 1): if tree[s][i] != 0 and check[i] == 0: check[i] = 1 q.appen..

from itertools import combinations n, m = map(int, input().split()) mat = [list(map(int, input().split())) for _ in range(n)] res = 0 for i in range(n): for j in range(m): if i < n - 3: res = max(res, sum([mat[i + k][j] for k in range(4)])) if j < m - 3: res = max(res, sum(mat[i][j:j + 4])) if i < n - 1 and j < m - 2: minus = 2000 com = list(combinations([[i, j], [i, j + 1], [i, j + 2], [i + 1, ..

n = int(input()) li = [] d = {} for _ in range(n): cur = list(input()) li.append(cur) for i in range(len(cur)): if cur[i] not in d: d[cur[i]] = [len(cur) - i, 10 ** (len(cur) - i - 1)] else: d[cur[i]][0] = len(cur) - i d[cur[i]][1] += 10 ** (len(cur) - i - 1) temp = sorted(map(list, d.items()), key=lambda x: (-x[1][1], -x[1][0])) for i in range(len(temp)): d[temp[i][0]] = 9 - i for i, l in enume..