몸과 마음이 건전한 SW 개발자

순열 만드는 방법 1. 방문 배열을 안에 N = 5 def dfs(S, N, V, chosen): if S == N: print(chosen) return for i in range(N): if i not in V: dfs(S+1, N, V+[i], chosen + [i]) 2. 방문 배열을 밖에 N = 5 V = [0 for _ in range(N)] def dfs2(S, chosen): if S == N: print(chosen) return for i in range(N): if V[i]: continue V[i] = 1 dfs2(S+1, chosen+[i]) V[i] = 0 dfs2(0, []) 조합 만드는 방법 L = 5 def dfs(S, wishL, nowL, chosen): if S >= ..

문제 링크 https://softeer.ai/practice/6271 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 정답 코드 import sys from collections import deque input = sys.stdin.readline R, C = map(int, input().split()) guidance = [] shower = [] boundaryShower = [] sr, sc = 0, 0 er, ec = 0, 0 def isValid(nr, nc): return 0

문제 링크 https://softeer.ai/practice/6289 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 정답 코드 import sys input = sys.stdin.readline N, M = map(int, input().split()) weights = list(map(int, input().split())) adjL = [[] for _ in range(N+1)] for _ in range(M): start, to = map(int, input().split()) adjL[start].append(to) adjL[to].append(start) V = [1 for _ in range(N+1)] for p in range(1, N+1): currentPW = we..