기록하는 습관

문제 www.acmicpc.net/problem/1068 코드 N = int(input()) parents = list(map(int, input().split())) delete = int(input()) def dfs(delete_node, arr): # delete_node를 부모로 갖는 원소 삭제 parents[delete_node] = -2 for i in range(len(parents)): if delete_node == parents[i]: dfs(i, parents) def main(): dfs(delete, parents) count = 0 for i in range(len(parents)): # leaf node 개수 세기 if parents[i] != -2 and i not in p..