https://www.acmicpc.net/problem/14888 import sysinput = sys.stdin.readlineN = int(input())num_li = list(map(int, input().split(" ")))s_li = list(map(int, input().split(" ")))min_num = 1e9max_num = -1e9def dfs(size, total, plus, minus, multi, div): global min_num, max_num if size == N: max_num = max(total, max_num) min_num = min(total, min_num) return if plus: ..
https://www.acmicpc.net/problem/15652 import sysinput = sys.stdin.readlineN, M = map(int, input().split(" "))dap = []def dfs(start): if len(dap) == M: print(' '.join(map(str, dap))) return for i in range(start, N+1): dap.append(i) dfs(i) dap.pop()dfs(1)
https://www.acmicpc.net/problem/2667 def dfs(x, y, cnt, visited): # 방향 벡터 (상하좌우) dx = [-1, 1, 0, 0] dy = [0, 0, -1, 1] n, m = len(li), len(li[0]) # 상하좌우 탐색 for i in range(4): nx, ny = x + dx[i], y + dy[i] # 맵 범위를 벗어나지 않고, 이동 가능하며, 방문하지 않았을 때 if 0
https://www.acmicpc.net/problem/1260 from collections import deque# DFSdef dfs(now): for nxt in range(N): if (li[now][nxt] or li[nxt][now]) and nxt+1 not in dfs_li: dfs_li.append(nxt+1) dfs(nxt)# BFSdef bfs(): dq = deque() dq.append(V-1) bfs_li.append(V) while dq: now = dq.popleft() for nxt in range(N): if (li[now][nxt] or li[n..
