목록13023 (1)
황소개발자
백준 13023 파이썬 python : ABCDE @@황소처럼 우직하게@@ DFS깔끔하네
import sys input = sys.stdin.readline n, m = map(int, input().split()) adj_lst = [[] for i in range(n)] for i in range(m): a, b = map(int, input().split()) adj_lst[a].append(b) adj_lst[b].append(a) visited = [False for i in range(n)] def dfs(v, depth): global ans visited[v] = True if depth >= 4: ans = True return for nxt in adj_lst[v]: if not visited[nxt]: dfs(nxt, depth + 1) visited[nxt] = Fals..
백준 문제 풀이
2020. 3. 2. 17:54