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

def isprime(num):
    if num==1:
        return False
    elif num==2:
        return True
    else:
        for i in range(2,num):
            if num%i==0:
                return False
    return True
                
            
def solution(nums):
    x=0
    for i in range(len(nums)):
        for j in range(i+1,len(nums)):
            for k in range(j+1,len(nums)):
                total = nums[i]+nums[j]+nums[k]
                if isprime(total):
                    x+=1
    return x