[프로그래머스] 소수 만들기.py

from itertools import combinations
import math
def solution(nums):
    candidates = combinations(nums, 3)
    answer = 0
    for item in candidates:
        sums = sum(item)
        is_prime = True
        for i in range(2, int(math.sqrt(sums)) + 1):
            if sums % i == 0:
                is_prime = False
                break
        if is_prime:
            answer += 1
    return answer