programmers - 소수 만들기

programmers.co.kr/learn/courses/30/lessons/12977

코딩테스트 연습 - 소수 만들기

def solution(nums):
    from itertools import combinations
    comb = list(combinations(nums,3))
    comb_sum = [0 for _ in range(len(comb))]
    for i in range(len(comb)):
        for j in comb[i]:
            comb_sum[i]+=j
    def primenum(n):
        temp = 0
        #소수인지아닌지판별
        for i in range(2,n):
            if n % i == 0:
                temp = 1
        return temp
    answer = 0
    for i in comb_sum:
        if primenum(i) == 0:
            answer += 1
    
    return answer