from itertools import combinations_with_replacement from collections import Counter def solution(n, info): answer = [-1] max_gap = 0 for arrow in combinations_with_replacement(range(10, -1, -1), n): apeach, lion = 0, 0 cnt = Counter(arrow) info2 = [0 for _ in range(11)] for i in range(11) : info2[i] = cnt[10-i] if info[i] > info2[i] : apeach += (10-i) elif info[i] < info2[i]: lion += (10-i) elif..
