takeU

n, m, r = map(int, input().split()) INF = int(1e9) item = [0] + list(map(int, input().split())) graph = [[0 if i == j else INF for i in range(n + 1)] for j in range(n + 1)] for _ in range(r): a, b, c = map(int, input().split()) graph[a][b] = graph[b][a] = 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] = graph[b][a] = min(graph[a][b], graph[a][k] + gra..

import sys input = sys.stdin.readline n = int(input()) first = list(map(int, input().split())) dp1, dp2 = first[:], first[:] for _ in range(n - 1): cur = list(map(int, input().split())) temp00 = cur[0] + max(dp1[0], dp1[1]) temp10 = cur[0] + min(dp2[0], dp2[1]) temp01 = cur[1] + max(dp1[0], dp1[1], dp1[2]) temp11 = cur[1] + min(dp2[0], dp2[1], dp2[2]) temp02 = cur[2] + max(dp1[1], dp1[2]) temp12..

import heapq import sys input = sys.stdin.readline INF = int(1e9) n, m, x = map(int, input().split()) graph = [[] for i in range(n + 1)] for _ in range(m): a, b, c = map(int, input().split()) graph[a].append((b, c)) def dijkstra(start): q = [] heapq.heappush(q, (0, start)) distance[start] = 0 while q: dist, now = heapq.heappop(q) if distance[now] < dist: continue for i in graph[now]: cost = dist..

n = int(input()) li = list(map(int, input().split())) def gcd(a, b): while b > 0: n = a % b a, b = b, n return a for i in range(1, n): g = gcd(li[0], li[i]) print(f&#39;{li[0]//g}/{li[i]//g}&#39;) 유클리드 호제법

from collections import deque n, k = map(int, input().split()) q = deque([[n, 0]]) visited = [0] * 100001 ans = [100000, 0] while q: x, c = q.popleft() visited[x] = 1 if x == k: if ans[0] > c: ans = [c, 1] elif ans[0] == c: ans[1] += 1 continue if 2 * x = 0 and..

from collections import deque n, m = map(int, input().split()) board = [list(map(int, list(input()))) for _ in range(n)] visited = [[[0] * 2 for _ in range(m)] for _ in range(n)] visited[0][0][0] = 1 dx = [0, 1, 0, -1] dy = [1, 0, -1, 0] q = deque([[0, 0, 0]]) while q: x, y, b = q.popleft() if x == n - 1 and y == m - 1: print(visited[x][y][b]) exit() for i in range(4): nx, ny = x + dx[i], y + dy..

import heapq import sys input = sys.stdin.readline INF = int(1e9) n, e = map(int, input().split()) graph = [[] for _ in range(n + 1)] for _ in range(e): a, b, c = map(int, input().split()) graph[a].append((b, c)) graph[b].append((a, c)) v1, v2 = map(int, input().split()) def dijkstra(start): q = [] distance = [INF] * (n + 1) heapq.heappush(q, (0, start)) distance[start] = 0 while q: dist, now = ..

n = int(input()) dp = [[0, []] for _ in range(n + 1)] for i in range(2, n + 1): dp[i][0] = dp[i - 1][0] + 1 dp[i][1] = dp[i - 1][1] + [i] if i % 3 == 0 and dp[i // 3][0] + 1 < dp[i][0]: dp[i][0] = dp[i // 3][0] + 1 dp[i][1] = dp[i // 3][1] + [i] if i % 2 == 0 and dp[i // 2][0] + 1 < dp[i][0]: dp[i][0] = dp[i // 2][0] + 1 dp[i][1] = dp[i // 2][1] + [i] print(dp[-1][0]) print(*(dp[-1][1][::-1] + [..

v, e = map(int, input().split()) parent = [0] * (v+1) for i in range(1, v+1): parent[i] = i def find_parent(parent, x): if parent[x] != x: parent[x] = find_parent(parent, parent[x]) return parent[x] def union_parent(parent, a, b): a = find_parent(parent, a) b = find_parent(parent, b) if a < b: parent[b] = a else: parent[a] = b edges = [] total_cost = 0 for _ in range(e): a, b, cost = map(int, in..