https://school.programmers.co.kr/learn/courses/30/lessons/12977
Summer/Winter Coding(~2018)
from itertools import combinations
def solution(nums):
sum_list = [sum(i) for i in list(combinations(nums, 3))]
answer = len(sum_list)
for sl in sum_list:
for i in range(sl-1, 1, -1):
if sl % i == 0:
answer -=1
break
return answer
List Comprehension을 사용했음
만약 합의 중복을 제거한다면 Set Comprehension을 사용하면 될 듯