Jerry의 컴퓨터 일기 💻

🔗링크 :  https://www.acmicpc.net/problem/14888🗒️파이썬 코드 풀이import syssys.setrecursionlimit(100000) input = sys.stdin.readlineN = int(input())lst = list(map(int,input().split()))add,sub,mul,div = map(int,input().split())mx = -sys.maxsizemn = sys.maxsizedef dfs(n,rs,add,sub,mul,div): global mn global mx if n == N: mn = min(rs,mn) mx = max(rs,mx) return if add > ..

🔗링크 :  https://www.acmicpc.net/problem/18352🗒️파이썬 코드 풀이import sysfrom collections import dequeinput = sys.stdin.readlineN,M,K,X = map(int,input().split())linked_lst = [[] for _ in range(N+1)]cost = [-1] * (N+1)for _ in range(M): s,e = map(int,input().split()) linked_lst[s].append(e)q =deque([X])cost[X] = 0while q: v = q.popleft() for e in linked_lst[v]: if cost[e] ==..