황소개발자

n = int(input()) mat = [] for i in range(n): mat.append(list(map(int, input().split()))) def next_permutation(lst): n = len(lst) i = n - 1 while i > 0 and lst[i - 1] >= lst[i]: i -= 1 if i == 0: return [-1] j = n - 1 while lst[i - 1] >= lst[j]: j -= 1 tmp = lst[j] lst[j] = lst[i - 1] lst[i - 1] = tmp lst = lst[:i] + sorted(lst[i:]) return lst pathes = [] path = [i for i in range(2, n + 1)] while..