무럭무럭 자라라

""" *packageName : * fileName : 24479_알고리즘 수업_깊이우선탐색 1 _S1 * author : ipeac * date : 2022-06-08 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-06-08 ipeac 최초 생성 """ import sys sys.setrecursionlimit(100000) def dfs(graph, v, visited, nodes_cnt): global cnt # 방문처리 visited[v] = Tru..

""" *packageName : * fileName : 13549_숨바꼭질3_G5 * author : ipeac * date : 2022-05-10 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-05-10 ipeac 최초 생성 """ from collections import deque MAX_SIZE = 100001 n, k = map(int, input().split()) visitied = [False] * MAX_SIZE dist = [-1] * M..

""" *packageName : * fileName : 1743_음식물 피하기_S1 * author : jihye94 * date : 2022-04-29 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-29 jihye94 최초 생성 """ from collections import deque def bfs(i, j): print("==========================================") queue.append((i, j)) vis..

""" *packageName : * fileName : 1697_숨바꼭질_S1 * author : ipeac * date : 2022-04-19 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-19 ipeac 최초 생성 """ from collections import deque n, k = map(int, input().split()) graph = [0 for _ in range(10 ** 6)] def bfs(x): queue = deque([x]..

""" *packageName : * fileName : 2667_단지번호붙이기_S1 * author : ipeac * date : 2022-04-19 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-19 ipeac 최초 생성 """ from collections import deque res = [] dx = [0, 1, -1, 0] dy = [1, 0, 0, -1] n = int(input()) graph = [list(map(int, input())..

""" *packageName : * fileName : 11725_트리의부모찾기_S2 * author : qkrtk * date : 2022-04-08 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-08 qkrtk 최초 생성 """ import sys input = sys.stdin.readline sys.setrecursionlimit(10 ** 5) # n 정점이자 노드루트의 개수 n = int(input()) graph = [[] for _ in..

""" *packageName : * fileName : 4963_섬의_개수_S2 * author : qkrtk * date : 2022-04-07 * description : * =========================================================== * DATE AUTHOR NOTE * ----------------------------------------------------------- * 2022-04-07 qkrtk 최초 생성 """ import sys sys.setrecursionlimit(10 ** 6) # DFS def dfs(x, y): if x >= w or x = h or y < 0 or graph[y][x] == 0: retur..

from collections import deque n, m, v = map(int, input().split()) graph = [[0 for i in range(n + 1)] for j in range(n + 1)] visited_d = [0] * (n + 1) visited_b = [0] * (n + 1) for i in range(m): line = list(map(int, input().split())) graph[line[0]][line[1]] = 1 graph[line[1]][line[0]] = 1 def dfs(graph, v, visited_d): visited_d[v] = 1 print(v, end=" ") for i in range(len(graph[v])): if visited_d..