https://www.acmicpc.net/problem/14888 import sysinput = sys.stdin.readlineN = int(input())num_li = list(map(int, input().split(" ")))s_li = list(map(int, input().split(" ")))min_num = 1e9max_num = -1e9def dfs(size, total, plus, minus, multi, div): global min_num, max_num if size == N: max_num = max(total, max_num) min_num = min(total, min_num) return if plus: ..
https://www.acmicpc.net/problem/15652 import sysinput = sys.stdin.readlineN, M = map(int, input().split(" "))dap = []def dfs(start): if len(dap) == M: print(' '.join(map(str, dap))) return for i in range(start, N+1): dap.append(i) dfs(i) dap.pop()dfs(1)
https://www.acmicpc.net/problem/14889 import sysfrom itertools import combinationsinput = sys.stdin.readlineN = int(input())li = list()for i in range(N): li.append(list(map(int, input().split(" "))))person = list(range(N))two_li = list(combinations(person, 2)) dic = dict()# 두명 경우의 수 시너지 합 모두 구하기for a, b in two_li: dic[f"{a},{b}"] = li[a][b] + li[b][a]one_team = N//2team = list(combinati..
https://www.acmicpc.net/problem/2012 import sysinput = sys.stdin.readlineN = int(input())#dict로 학생들의 예상 등수 저장#예상 순위대로 dict 정렬#각 학생마다 불만도 구한 뒤 합dic = dict()for i in range(N): dic[i] = int(input())li = sorted(dic, key=lambda x:dic[x])dap = 0for rank in range(len(li)): dap += abs(dic[li[rank]]-(rank+1))print(dap)
