takeU

const checkSquare = (board, x, y) => { const block = board[x][y] if (board[x + 1][y] === block && board[x][y + 1] === block && board[x + 1][y + 1] === block) return true return false}const checkTargetBlocks = (m, n, board) => { const targetBlocks = [] for (let i = 0; i { let count = 0 targetBlocks.forEach(([x, y]) => { board[x][y] = 'Xcur' board[..

const bfs = (land, visited, cur, i, j) => { const dx = [-1, 0, 1, 0] const dy = [0, -1, 0, 1] const queue = [[i, j]] let count = 0; while (queue.length) { const [x, y] = queue.shift() visited[x][y] = 1 land[x][y] = cur for (let k = 0; k { const visited = Array.from({ length: land.length }, () => Array(land[0].length).fill(0)); const amount = {} ..

const solution = (diffs, times, limit) => { let [left, right] = [1, diffs.reduce((acc, cur) => Math.max(acc, cur), 1)] while (left = diffs[i]) cur += times[i] else cur += (diffs[i] - check) * (times[i] + times[i - 1]) + times[i] } if (cur > limit) left = check + 1 else right = check } return left}이분탐색30만에서 Math.max는 런타임 에러유발 -ㅠ-

const timeToSeconds = (time) => { const [minutes, seconds] = time.split(':').map(Number); return minutes * 60 + seconds;}const secondsToTime = (seconds) => { const minutes = Math.floor(seconds / 60); const remainingSeconds = seconds % 60; return `${String(minutes).padStart(2, '0')}:${String(remainingSeconds).padStart(2, '0')}`;};const solution = (video_len, pos, op_start, op_end, ..

import sys input = sys.stdin.readline d = {} for _ in range(int(input())): s, x = input().split() d[s] = d.get(s, 0) + int(x) for n in d: if d[n] == 5: print('YES') exit() print('NO')

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 수학