728x90
from itertools import combinations
 
def find(n):
    for i in range(2,int(n**0.5)+1):
        if n%i==0:
            return False
    return True
 
def solution(number):
    answer = 0
    k = list(combinations(number,3))
 
    for i in range(0,len(k)):
        if find(sum(k[i]))==True:
            answer+=1
    return answer
 
728x90

+ Recent posts