takeU

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

import sys input = sys.stdin.readline from heapq import heappush, heappop n, k = map(int, sys.stdin.readline().split()) jewelry = sorted([list(map(int, input().split())) for _ in range(n)]) bag = sorted([int(input()) for _ in range(k)]) ans, temp = 0, [] for b in bag: while jewelry and b >= jewelry[0][0]: heappush(temp, -jewelry[0][1]) heappop(jewelry) if temp: ans += heappop(temp) elif not jewe..

from bisect import bisect_left, bisect_right t = int(input()) n = int(input()) li_a = list(map(int, input().split())) m = int(input()) li_b = list(map(int, input().split())) def sum_li(li): res = [] for i in range(len(li)): acc = 0 for j in range(i, len(li)): acc += li[j] res.append(acc) return res s_a, s_b = sorted(sum_li(li_a)), sorted(sum_li(li_b)) ans = 0 for s in s_a: left = bisect_left(s_b..

import sys input = sys.stdin.readline n = int(input()) mat = [[] for _ in range(4)] for _ in range(n): li = list(map(int, input().split())) for i in range(4): mat[i].append(li[i]) d, ans = {}, 0 for i in mat[0]: for j in mat[1]: d[i + j] = d.get(i + j, 0) + 1 for i in mat[2]: for j in mat[3]: if -(i + j) in d: ans += d[-(i + j)] print(ans)

t = int(input()) def extended_gcd(a, b): x0, x1, y0, y1 = 1, 0, 0, 1 while b != 0: n, a, b = a // b, b, a % b x0, x1 = x1, x0 - n * x1 y0, y1 = y1, y0 - n * y1 return x0, x1, y0, y1 for _ in range(t): k, c = map(int, input().split()) x0, x1, y0, y1 = extended_gcd(c, k) if c == 1: print('IMPOSSIBLE' if k >= 1e9 else k + 1) elif x1 != -k and y1 != -c: print('IMPOSSIBLE') else: ans = x0 if x0 > 0 e..