programmers | Lv1. 소수 만들기 [Python]

💡 Python 3

🔗 문제

소수 만들기 [Link]

💻 코드

def solution(nums):
    from itertools import combinations
    count = 0
    com = list(combinations(nums, 3))
    for i in com:
        k = sum(i)
        for j in range(2, k):
            if k % j == 0:
                count +=1
                break
    return len(com) - count

💥 다른 사람 코드

from itertools import combinations
def prime_number(x):
    answer = 0
    for i in range(1,int(x**0.5)+1):
        if x%i==0:
            answer+=1
    return 1 if answer==1 else 0

def solution(nums):
    return sum([prime_number(sum(c)) for c in combinations(nums,3)])