아...그 뭐였더라..

https://www.acmicpc.net/problem/18126# 18126 너구리 구구import sysinput = sys.stdin.readlinesys.setrecursionlimit(10**7)n = int(input())graph = [[] for _ in range(n+1)]visited = [False] * (n+1)dist = [0] * (n+1)for _ in range(n-1): a,b,c = map(int, input().split()) graph[a].append([b,c]) graph[b].append([a,c])def dfs(v): visited[v] = True for i, d in graph[v]: if not visited[i]:..

def solution(new_id): answer = '' # 1단계 new_id = new_id.lower() # 2단계 for word in new_id: if word.isalnum() or word in '-_.': answer += word # 3단계 while '..' in answer: answer = answer.replace('..','.') # 4단계 answer = answer[1:] if answer[0] == '.' and len(answer) > 1 else answer answer = answer[:-1] if answer[-1] == '.' else answer #..