aspe

list = [i * 0.01 for i in range(1, 10000)] for i in list: if int(i * 100) != int(i * 100 + 0.5): print(i, i * 100, int(i * 100), int(i * 100 + 0.5))

import collections answer = 0 def solution(info, edges): graph = collections.defaultdict(list) for src, dst in edges: graph[src].append(dst) def dfs(s, sheep, wolf, path): # 양, 늑대 확인 if not info[s]: sheep += 1 else: wolf += 1 if wolf >= sheep: return global answer answer = max(answer, sheep) # 직후 DFS에서는 현재 노드를 탐색할 필요가 없다. if path: path.remove(s) path.extend(graph[s]) for i in path: dfs(i, sheep,..