삽집하는 개발들/알고리즘

[43일차][프로그래머스][Summer/Winter Coding(~2018)][12977]소수 만들기

악투 2023. 8. 11. 18:17
반응형
def check_decimal(merge_number):
    count = 0
    for idx in range(2, merge_number+1):
        if merge_number % idx != 0:
            if idx+1 == merge_number:                
                count = 1
            else:
                continue
        else:
            break
    
    return count
    
def solution(nums):
    count = 0
    nums_len = len(nums)
    for idx1 in range(nums_len):
        for idx2 in range(idx1+1, nums_len):
            for idx3 in range(idx2+1, nums_len):
                merge_number = nums[idx1] + nums[idx2] + nums[idx3]
                count += check_decimal(merge_number)
    
    return count
반응형