takeU

n = int(input()) li = sorted(list(map(int, input().split()))) prev = li[0] ans, temp = 0, [li[0]] for i in range(1, n): cur = li[i] if prev + 1 == cur: temp.append(cur) prev = cur else: ans += temp[0] temp = [cur] prev = cur print(ans + temp[0])

def prime(n): li = [0, 0] + [1] * n for i in range(2, n + 1): if li[i]: for j in range(2 * i, n + 1, i): li[j] = 0 return li li = prime(1000000) for _ in range(int(input())): n = int(input()) flag = 1 for i in range(2, min(1000001, int(n ** 0.5) + 1)): if li[i] and not n % i: flag = 0 break print('YES' if flag else 'NO') 1. 에라토스테네스의 체로 소수 구하기 2. 소수로 나누어 떨어지면 NO 끝까지 통과하면 YES

from functools import reduce d = {} def sort_word(word): if len(word) == 1: return word return word[0] + word[-1] + ''.join(sorted(word[1:-1])) n = int(input()) for _ in range(n): word = sort_word(input()) d[word] = d.get(word, 0) + 1 for _ in range(int(input())): sentence = input().split() li = [] for s in sentence: word = sort_word(s) li.append(d[word] if word in d else 0) print(reduce(lambda ..

def dfs(cards, cur, visited, count): if not visited[cur]: visited[cur] = count return dfs(cards, cards[cur] - 1, visited, count) return def solution(cards): visited = [0] * len(cards) count = 1 for c in cards: if not visited[c - 1]: dfs(cards, c - 1, visited, count) count += 1 check = {} for v in visited: check[v] = check.get(v, 0) + 1 ans = sorted(list(check.values()), reverse=True) return ans[..

def solution(k, d): ans = 0 for i in range(0, d + 1, k): ans += int((d ** 2 - i ** 2) ** 0.5) // k + 1 return ans 수학

from itertools import product from copy import deepcopy def combine(li): i, count = 1, 0 res = [] while i count: res.append(li[-1]) return res def up(board): res = [[0] * n for _ in range(n)] for i in range(n): temp = [] for j in range(n): if board[j][i] > 0: ..

import sys input = sys.stdin.readline def bimatch(num): if visited[num]: return False visited[num] = 1 for g in graph[num]: if selected[g] == -1 or bimatch(selected[g]): selected[g] = num return True return False n, m = int(input()), int(input()) board = [[0] * n for _ in range(n)] for _ in range(m): x, y = map(int, input().split()) board[x - 1][y - 1] = 1 check_board = [[0] * n for _ in range(n..

def get_prime(n): li = [0, 0] + [1] * n for i in range(2, n + 1): if li[i]: for j in range(2 * i, n + 1, i): li[j] = 0 return li def bimatch(num): if visited[num]: return False visited[num] = 1 for g in graph[num]: if selected[g] == -1 or bimatch(selected[g]): selected[g] = num visited[g] = 1 return True return False n = int(input()) li = list(map(int, input().split())) prime = get_prime(2000) o..

def bimatch(num): if visited[num]: return False visited[num] = 1 for g in graph[num]: if selected[g] == -1 or bimatch(selected[g]): selected[g] = num return True return False n, m = map(int, input().split()) board = [list(map(int, input().split())) for _ in range(n)] row_board = [[0] * m for _ in range(n)] count = 0 for i in range(n): count += 1 check = 0 for j in range(m): if board[i][j] < 2: r..

import sys input = sys.stdin.readline def find_parent(x): if parent[x] != x: return find_parent(parent[x]) return x def union_parent(a, b): a = find_parent(a) b = find_parent(b) if a != b: parent[max(a, b)] = min(a, b) edge_count[min(a, b)] = edge_count.get(min(a, b), 0) + 1 i = 1 while True: n, m = map(int, input().split()) if not n + m: break parent = list(range(n)) node_count, edge_count = {}..