takeU

from itertools import combinations from math import gcd n = int(input()) li = sorted([int(input()) for _ in range(n)]) ans = [] g = li[1] - li[0] for i in range(n - 1): g = gcd(g, li[i + 1] - li[i]) for j in range(2, int(g ** 0.5) + 1): if g % j == 0: ans.append(j) ans.append(g // j) ans.append(g) ans = sorted(list(set(ans))) print(*ans) gcd

l = int(input()) li = sorted(list(map(int, input().split())) + [0]) t = int(input()) ans = 0 for i in range(len(li) - 1): if li[i] == t or li[i + 1] == t: ans = 0 break elif li[i] < t < li[i + 1]: ans = (t - li[i]) * (li[i + 1] - t) - 1 break print(ans)

while True: graph = list(map(int, input().split())) + [0] n, graph = graph[0], graph[1:] if n == 0: break left, ans = 0, 0 stack = [(0, graph[0])] for right in range(1, len(graph)): left = right while stack and stack[-1][1] > graph[right]: left, height = stack.pop() ans = max(ans, height * (right - left)) stack.append((left, graph[right])) print(ans) 스택

while True: s = input().split() if s == ['#']: break li = list(map(lambda x: x[0] if len(x) == 1 else x[0] + x[1:-1][::-1] + x[-1], s)) print(' '.join(li))

for i in range(1, int(input()) + 1): print(f'Case #{i}: {" ".join(input().split()[::-1])}')

import sys input = sys.stdin.readline n = int(input()) graph = [int(input()) for _ in range(n)] + [0] left, ans = 0, 0 stack = [(0, graph[0])] for right in range(1, n + 1): left = right while stack and stack[-1][1] > graph[right]: left, height = stack.pop() ans = max(ans, height * (right - left)) stack.append((left, graph[right])) print(ans) 스택

import sys input = sys.stdin.readline def find_parent(x, parent): if x != parent[x]: parent[x] = find_parent(parent[x], parent) return parent[x] def union_parent(a, b, parent): a = find_parent(a, parent) b = find_parent(b, parent) if a < b: parent[b] = a else: parent[a] = b n = int(input()) li = [list(map(int, input().split())) + [i] for i in range(n)] edges = [] for i in range(3): li.sort(key=l..

n = int(input()) li = sorted(list(map(int, input().split()))) def check(): s = 0 if sum(li) != n * (n - 1) // 2: return -1 for i, l in enumerate(li[:-1]): s += l if s < i * (i + 1) // 2: return -1 return 1 print(check()) 수학 tournament graph

import sys input = sys.stdin.readline n = int(input()) li = list(map(int, input().split())) dp = [[0] * n for _ in range(n)] for l in range(n): for s in range(n - l): e = s + l if s == e: dp[s][e] = 1 elif li[s] == li[e]: if s + 1 == e or dp[s + 1][e - 1] == 1: dp[s][e] = 1 m = int(input()) for _ in range(m): s, e = map(int, input().split()) print(dp[s - 1][e - 1]) dp

n, m = map(int, input().split()) board = [list(input()) for _ in range(n)] visited = [[0] * m for _ in range(n)] d = { 'L': [0, -1], 'R': [0, 1], 'U': [-1, 0], 'D': [1, 0] } count, ans = 0, 0 def dfs(x, y, c): global ans if visited[x][y]: if visited[x][y] == c: ans += 1 return visited[x][y] = c nx, ny = x + d[board[x][y]][0], y + d[board[x][y]][1] dfs(nx, ny, c) for i in range(n): for j in range..