[Programmers Lv.1][소수 만들기][python]

https://school.programmers.co.kr/learn/courses/30/lessons/12977?language=python3

---

처음에는,
조합 함수가 기억이 나지 않아서 한 케이스 조합은 무조건 6이여서 결과에서 나누는 방법으로 풀었다.

from itertools import combinations

def p(nums):
    for i in range(3, nums):
        if nums % i == 0:
            return False
    return True

def solution(nums):
    cnt = 0
    for i in range(len(nums)):
        for j in range(len(nums)):
            for k in range(len(nums)):
                if i != j and j != k and k != i:
                    if p(nums[i]+nums[j]+nums[k]):
                        cnt += 1

    return int(cnt/6)

< 수정 >

def p(nums):
    for i in range(3, nums):
        if nums % i == 0:
            return False
    return True

def solution(nums):
    answer = 0
    from itertools import combinations
    for n in combinations(nums, 3):
        if p(sum(n)):
            answer += 1
    return answer