takeU

import sys input = sys.stdin.readline def find_parent(parent, x): if parent[x] != x: return find_parent(parent, parent[x]) return x def union_parent(parent, a, b, c): a = find_parent(parent, a) b = find_parent(parent, b) if a != b: parent[max(a, b)] = min(a, b) else: return c return 0 n, m = map(int, input().split()) parents = list(range(n)) ans = 0 for i in range(1, m + 1): x, y = map(int, inpu..

per = input() n = (len(per) - 9) // 2 + 9 if len(per) > 9 else len(per) check = [0] * (n + 1) ans = [] def bt(p): if sum(check) == n: print(*ans) exit() if len(p) >= 2: cur = int(p[:2]) if cur

https://www.youtube.com/watch?v=KCkdp45UoCk https://www.youtube.com/watch?v=A3ETK4WJvVo https://www.youtube.com/watch?v=5wG5GE4eTV8

import sys input = sys.stdin.readline n = int(input()) stack, ans = [], 0 for _ in range(n): x, y = map(int, input().split()) while stack and stack[-1] > y: ans += 1 stack.pop() if stack and stack[-1] == y: continue stack.append(y) while stack: if stack[-1] > 0: ans += 1 stack.pop() print(ans) 스택

import sys input = sys.stdin.readline INF = int(1e9) n, m = int(input()), int(input()) graph = [[[INF, [i, j]] for j in range(n + 1)] for i in range(n + 1)] for _ in range(m): a, b, c = map(int, input().split()) graph[a][b][0] = min(graph[a][b][0], c) for k in range(1, n + 1): for i in range(1, n + 1): for j in range(1, n + 1): if i == j: graph[i][j][0] = 0 else: if graph[i][j][0] > graph[i][k][..

check = [0] * 26 while True: try: s = input() for c in s: if c != ' ': check[ord(c) - 97] += 1 except: break m = max(check) for i, c in enumerate(check): if c == m: print(chr(i + 97), end='') 구현

n = int(input()) check = [0] * 26 for _ in range(n): s = input().split() i, ans = 0, False for i in range(len(s)): if not check[ord(s[i][0].lower()) - 97]: check[ord(s[i][0].lower()) - 97] = 1 s[i] = '[' + s[i][0] + ']' + s[i][1:] ans = True break if ans: print(' '.join(s)) continue s = ' '.join(s) for i, c in enumerate(s): if c != ' ' and not check[ord(c.lower()) - 97]: check[ord(c.lower()) - 9..

https://www.youtube.com/watch?v=N4qoasM8-QM

https://www.youtube.com/watch?v=o3IZhn2O_aM https://www.youtube.com/watch?v=UgBAuI594V0