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

[46일차][프로그래머스][136798]기사단원의 무기

악투 2023. 8. 22. 22:33
반응형
def check_measure(number, limit, power):
    check_number = 0
    for idx in range(1, int(number**(1/2))+1):       
        if number % idx == 0:
            check_number += 1
            if (idx**2) != number:
                check_number += 1

    if check_number > limit:
        return power
    else:
        return check_number

def solution(number, limit, power):
    count = 0
    for idx in range(1, number+1):
        count += check_measure(idx, limit, power)
        
    return count

 

반응형