takeU

t = int(input()) for _ in range(t): li = input().split() while True: cur = input() if cur == 'what does the fox say?': break li = [l for l in li if l != cur.split()[2]] print(' '.join(li))

import re n = int(input()) li = [] for _ in range(n): line = input() li += re.compile('[0-9]+').findall(line) for l in sorted(list(map(int, li))): print(l) 정규식

from itertools import combinations def gcd(a, b): if a < b: a, b = b, a if a % b == 0: return b else: return gcd(b, a % b) n = int(input()) for _ in range(n): li = list(map(int, input().split())) com = list(combinations(li, 2)) m = 1 for c in com: m = max(m, gcd(c[0], c[1])) print(m) 완탐, 유클리드 호제법

x, y, d, t = map(int, input().split()) ans = distance = (x ** 2 + y ** 2) ** 0.5 q = distance // d if distance >= d: ans = min(ans, q * t + distance % d, (q + 1) * t) else: ans = min(ans, t + (d - distance), 2 * t) print(ans) 기하

li = [list(map(int, input().split())) for _ in range(2)] a, b, c, d = li[0][:2], li[0][2:], li[1][:2], li[1][2:] def ccw(x1, y1, x2, y2, x3, y3): c = (x2 - x1) * (y3 - y1) - (y2 - y1) * (x3 - x1) return 0 if c == 0 else c // abs(c) l1 = ccw(*a, *b, *c) * ccw(*a, *b, *d) l2 = ccw(*c, *d, *a) * ccw(*c, *d, *b) if not l1 and not l2: if a > b: a, b = b, a if c > d: c, d = d, c print(1 if a

import sys input = sys.stdin.readline n, m = map(int, input().split()) s = list(range(n + 1)) def find_parent(parent, x): if parent[x] != x: return find_parent(parent, parent[x]) return x def find_num(parent, x, y): if x == y or find_parent(parent, x) == find_parent(parent, y): print("YES") else: print("NO") def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if..

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

import sys input = sys.stdin.readline INF = int(1e9) n, m = map(int, input().split()) edges = [] dist = [INF] * (n + 1) for _ in range(m): a, b, c = map(int, input().split()) edges.append((a, b, c)) def bf(start): dist[start] = 0 for i in range(n): for j in range(m): node, next_node, cost = edges[j] if dist[node] != INF and dist[next_node] > dist[node] + cost: dist[next_node] = dist[node] + cost..

from collections import deque import sys input = sys.stdin.readline k = int(input()) def bfs(node): q = deque([node]) visited[node] = 1 while q: cur = q.popleft() for g in graph[cur]: if not visited[g]: visited[g] = -visited[cur] q.append(g) elif visited[g] == visited[cur]: return False return True for _ in range(k): v, e = map(int, input().split()) graph = [[] for _ in range(v + 1)] visited = [..

n, k = map(int, input().split()) li = list(map(int, input().split())) count = 0 for i in range(n - 1, 0, -1): idx = li.index(max(li[:i + 1])) if idx != i: li[idx], li[i] = li[i], li[idx] count += 1 if count == k: print(*li) exit() print(-1) 선택 정렬